mlsanityData to 7 Oct 2026

Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum

arXiv 2501.08883 ↗First posted 15 Jan 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Stochastic gradient descent with momentum (SGDM), in which a momentum term is added to SGD, has been well studied in both theory and practice. The theoretical studies show that the settings of the learning rate and momentum weight affect the convergence of SGDM. Meanwhile, the practical studies have shown that the batch-size setting strongly affects the performance of SGDM. In this paper, we focus on mini-batch SGDM with a constant learning rate and constant momentum weight, which is frequently used to train deep neural networks. We show theoretically that using a constant batch size does not always minimize the expectation of the full gradient norm of the empirical loss in training a deep neural network, whereas using an increasing batch size definitely minimizes it; that is, an increasing batch size improves the convergence of mini-batch SGDM. We also provide numerical results supporting our analyses, indicating specifically that mini-batch SGDM with an increasing batch size converges to stationary points faster than with a constant batch size, while also reducing computational cost. Python implementations of the optimizers used in the numerical experiments are available at https://github.com/iiduka-researches/NSHB_increasing_batchsize_acml25/.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 36 references that are in the map. First posted on arXiv 15 Jan 2025.

Builds on

22 of 36 references.

References · 22

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  3. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
  4. 2018Measuring the Effects of Data Parallelism on Neural Network Trainingcited by 190
  5. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 178
  6. 2020An Improved Analysis of Stochastic Gradient Descent with Momentumcited by 117
  7. 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 116
  8. 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
  9. 2018A Unified Analysis of Stochastic Momentum Methods for Deep Learningcited by 54
  10. 2018Quasi-hyperbolic momentum and Adam for deep learningcited by 47
  11. 2018On the insufficiency of existing momentum schemes for Stochastic Optimizationcited by 46
  12. 2019Understanding the Role of Momentum in Stochastic Gradient Methodscited by 42
10 more
  1. 2020Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimizationcited by 32
  2. 2016Coupling Adaptive Batch Sizes with Learning Ratescited by 29
  3. 2017A Robust Accelerated Optimization Algorithm for Strongly Convex Functionscited by 14
  4. 2024Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descentcited by 11
  5. 2022Accelerated SGD for Non-Strongly-Convex Least Squarescited by 9
  6. 2022Existence and Estimation of Critical Batch Size for Training Generative Adversarial Networks with Two Time-Scale Update Rulecited by 8
  7. 2023Risk Bounds of Accelerated SGD for Overparameterized Linear Regressioncited by 7
  8. 2020Balancing Rates and Variance via Adaptive Batch-Size for Stochastic Optimization Problemscited by 6
  9. 2024Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Ratescited by 5
  10. 2024A general framework of Riemannian adaptive optimization methods with a convergence analysiscited by 5

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.