AI & ML
The Best Optimizer Depends on Batch Size
arXiv stat.ML0 views
arXiv:2610.08975v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2610.08975PreviousThe Utility and Complexity of in- and out-of-Distribution Machine UnlearningNextLASER: Latent Space Adjoint Matching for Support-Constrained Entropy-Regularized Offline RL
Related posts
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch
Marvell and Lumentum sign definitive 115 billion dollars all-stock merger to build an AI-connectivity leader
0dev.to