mlsanityData to 14 Oct 2026

Momentum in large-batch training: Polyak enlarges the critical batch size, Nesterov improves data efficiency

arXiv 2609.02728 ↗First posted 2 Sep 2026stat.ML cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

We study when and how momentum improves large-batch training in the one-pass regime, using power-law kernel regression as a tractable setting. We first characterize risk stability through the critical learning rate, defined as the largest learning rate for stable training, and obtain ηSGDcriteqsim 1, ηPolyakcriteqsim min1,B(1-ρ), and ηNesterovcriteqsim min1,Bβ(1-ρ), where B is the batch size, ρ is the momentum factor, and β>1 is the capacity exponent. Within this admissible region, we derive scaling laws for the full risk dynamics, capturing the progression from an early transient, through power-law decay, to a noise floor. We then minimize the final-step risk over the admissible learning rates and momentum factors under a fixed data budget, yielding a three-regime batch-size phase diagram that reveals how the role of momentum changes with batch size. Notably, Polyak enlarges the critical batch size, the largest batch size preserving the best small-batch data-scaling exponent, thereby enabling greater parallelism without sacrificing data efficiency. In contrast, Nesterov achieves better data efficiency in the large-batch regime because its look-ahead mechanism suppresses noise accumulation. Numerical experiments validate the predicted stability boundaries, risk dynamics, and batch-size phase diagram.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 74 references that are in the map. First posted on arXiv 2 Sep 2026.

Builds on

20 of 74 references.

References · 20

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2020Scaling Laws for Neural Language Modelscited by 6,586
  3. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  4. 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
  5. 2025Muon is Scalable for LLM Trainingcited by 428
  6. 2022A Solvable Model of Neural Scaling Lawscited by 116
  7. 2021Learning Curve Theorycited by 85
  8. 2025Practical Efficiency of Muon for Pretrainingcited by 80
  9. 20244+3 Phases of Compute-Optimal Neural Scaling Lawscited by 68
  10. 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 68
  11. 2025The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Trainingcited by 30
  12. 2023A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descentcited by 9
8 more
  1. 2026Logarithmic-time Schedules for Scaling Language Models with Momentumcited by 9
  2. 2018Accelerating SGD with momentum for over-parameterized learningcited by 8
  3. 2024The Optimality of (Accelerated) SGD for High-Dimensional Quadratic Optimizationcited by 8
  4. 2026Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup-Stable-Decaycited by 8
  5. 2025Scaling Law for Stochastic Gradient Descent in Quadratically Parameterized Linear Regressioncited by 2
  6. 2026Compute Efficiency and Serial Runtime Tradeoffs for Stochastic Momentum Methodscited by 2
  7. 2025Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameterscited by 1
  8. 2026Asymmetric Scaling Laws from Sparse Featurescited by 1

Built on by

Not cited yet.