Connections between Schedule-Free Optimizers, AdEMAMix, and Accelerated SGD Variants

Depen Morwani, Nikhil Vyas, Hanlin Zhang, Sham Kakade
2/4/2025
cs.LGcs.AI

Official code: DepenM/Simplified-AdEMAMix (8 stars, MIT, last commit 2025-02-04).

Abstract

Recent advancements in deep learning optimization have introduced new algorithms, such as Schedule-Free optimizers, AdEMAMix, MARS and Lion which modify traditional momentum mechanisms. In a separate line of work, theoretical acceleration of stochastic gradient descent (SGD) in noise-dominated regime has been achieved by decoupling the momentum coefficient from the current gradient's weight. In this paper, we establish explicit connections between these two lines of work. We substantiate our theoretical findings with preliminary experiments on a 150m language modeling task. We find that AdEMAMix, which most closely resembles accelerated versions of stochastic gradient descent, exhibits superior performance. Building on these insights, we introduce a modification to AdEMAMix, termed Simplified-AdEMAMix, which maintains the same performance as AdEMAMix across both large and small batch-size settings while eliminating the need for two different momentum terms. The code for Simplified-AdEMAMix is available on the repository: https://github.com/DepenM/Simplified-AdEMAMix/.

View on arXivView PDF

Code Implementations(1)

MIT
81PythonJan 31, 20251 years agoMIT

Similar Papers

Cite this paper

@article{morwani2025connections,
  title  = {Connections between Schedule-Free Optimizers, AdEMAMix, and Accelerated SGD Variants},
  author = {Depen Morwani and Nikhil Vyas and Hanlin Zhang and Sham Kakade},
  year   = {2025},
  eprint = {2502.02431},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.02431v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.02431.svg)](https://codeofpaper.com/paper/2502.02431)

Discussion