The Best Optimizer Depends on Batch Size

Xingyu Dang, Kaiyue Wen, Sadhika Malladi
10/6/2026
cs.LGstat.ML

No official code found. Best implementation: dangxingyu/batch-size-blog (0 stars, last commit 2026-10-07).

Abstract

A plethora of new adaptive optimizers are designed to efficiently estimate and use minibatch gradient statistics to shape parameter updates, but they are typically benchmarked at a single batch size. Hyperparameter scaling rules promise to preserve performance as batch size and gradient noise change, suggesting that the best optimizer at one batch size should remain the best at another. We challenge this approach to developing and evaluating optimizers by showing: (1) no principled scaling rule for Muon works consistently across training settings, and (2) the best optimizer for language model pretraining changes with batch size even after extensive hyperparameter tuning.

View on arXivView PDF

Code Implementations(1)

Interactive research blog: The Best Optimizer Depends on Batch Size

00Oct 2, 20262 weeks ago

Similar Papers

Cite this paper

@article{dang2026best,
  title  = {The Best Optimizer Depends on Batch Size},
  author = {Xingyu Dang and Kaiyue Wen and Sadhika Malladi},
  year   = {2026},
  eprint = {2610.08975},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.08975v1}
}

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/2610.08975.svg)](https://codeofpaper.com/paper/2610.08975)

Discussion