← Search

Philip Zmushko

4 accepted papers

2026

DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers

ICML 2026poster

Shampoo is one of the leading approximate second-order optimizers: a variant of it has won the MLCommons AlgoPerf competition, and it has been shown to produce models with lower activation outliers that are easier to compress. Yet, applying Shampoo currently comes at the cost of significant computat…

Cited by 0SourceScholar
2026

One-Step Gradient Delay is Not a Barrier for Large-Scale Asynchronous Pipeline Parallel LLM Pretraining

ICML 2026poster

Modern large-scale LLM pretraining benefits from utilizing Pipeline Parallelism; however, synchronous implementations leave GPUs idle during pipeline bubbles, wasting computational resources. Asynchronous Pipeline Parallelism approaches effectively eliminate these bubbles, maximizing throughput at t…

Cited by 0SourceScholar
2026

Sign-SGD via Parameter-Free Optimization

ICLR 2026poster

Large language models have achieved major advances across domains, yet training them remains extremely resource-intensive. We revisit Sign-SGD, which serves both as a memory-efficient optimizer for single-node training and as a gradient compression mechanism for distributed learning. This paper addr…

Cited by 0SourceScholar
2025

FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Training

ICML 2025poster

With the increase in the number of parameters in large language models, the training process increasingly demands larger volumes of GPU memory. A significant portion of this memory is typically consumed by the optimizer state. To overcome this challenge, recent approaches such as low-rank adaptation…