Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent
Not on the map. Why?
Abstract (arXiv)
The performance of mini-batch stochastic gradient descent (SGD) strongly depends on setting the batch size and learning rate to minimize the empirical loss in training the deep neural network. In this paper, we present theoretical analyses of mini-batch SGD with four schedulers: (i) constant batch size and decaying learning rate scheduler, (ii) increasing batch size and decaying learning rate scheduler, (iii) increasing batch size and increasing learning rate scheduler, and (iv) increasing batch size and warm-up decaying learning rate scheduler. We show that mini-batch SGD using scheduler (i) does not always minimize the expectation of the full gradient norm of the empirical loss, whereas it does using any of schedulers (ii), (iii), and (iv). Furthermore, schedulers (iii) and (iv) accelerate mini-batch SGD. The paper also provides numerical results of supporting analyses showing that using scheduler (iii) or (iv) minimizes the full gradient norm of the empirical loss faster than using scheduler (i) or (ii).
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 20 of its 32 references that are in the map. First posted on arXiv 13 Sep 2024.
Builds on
20 of 32 references.
References · 20
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
- 2018Bag of Tricks for Image Classification with Convolutional Neural Networkscited by 430
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
- 2018Measuring the Effects of Data Parallelism on Neural Network Trainingcited by 190
- 2023Handbook of Convergence Theorems for (Stochastic) Gradient Methodscited by 158
- 2020Better Theory for SGD in the Nonconvex Worldcited by 156
8 more
- 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
- 2019Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Ratescited by 119
- 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 116
- 2018A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillationcited by 110
- 2019Convergence rates for the stochastic gradient descent method for non-convex objective functionscited by 66
- 2016Coupling Adaptive Batch Sizes with Learning Ratescited by 29
- 2021On the Convergence of Step Decay Step-Size for Stochastic Optimizationcited by 21
- 2019sharpDARTS: Faster and More Accurate Differentiable Architecture Searchcited by 19
Built on by
Citing papers per year: 2025: 8; 2026: 3.
11 papers.
- 2026Improved Convergence Rates of Muon Optimizer for Nonconvex Optimizationcited by 9
- 2025Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentumcited by 2
- 2025Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Sizecited by 2
- 2026Muon Converges under Heavy-Tailed Noise: Nonconvex H"older-Smooth Empirical Risk Minimizationcited by 2
- 2025Both Asymptotic and Non-Asymptotic Convergence of Quasi-Hyperbolic Momentum using Increasing Batch Sizecited by 1
- 2025Accelerating SGDM via Learning Rate and Batch Size Schedules: A Lyapunov-Based Analysiscited by 1
- 2025Enlightenment Period Improving DNN Performancecited by 0
- 2025Explainable Learning Rate Regimes for Stochastic Optimizationcited by 0
- 2025Tri-Accel: Curvature-Aware Precision-Adaptive and Memory-Elastic Optimization for Efficient GPU Usagecited by 0
- 2025Convergence Analysis of SGD under Expected Smoothnesscited by 0
- 2026Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regressioncited by 0
- 2026Muon Converges under Heavy-Tailed Noise: Nonconvex H"older-Smooth Empirical Risk Minimization16 Mar 2026
- 2026Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression21 Feb 2026
- 2026Improved Convergence Rates of Muon Optimizer for Nonconvex Optimization27 Jan 2026
- 2025Convergence Analysis of SGD under Expected Smoothness23 Oct 2025
- 2025Tri-Accel: Curvature-Aware Precision-Adaptive and Memory-Elastic Optimization for Efficient GPU Usage23 Aug 2025
- 2025Explainable Learning Rate Regimes for Stochastic Optimization19 Aug 2025
- 2025Accelerating SGDM via Learning Rate and Batch Size Schedules: A Lyapunov-Based Analysis5 Aug 2025
- 2025Both Asymptotic and Non-Asymptotic Convergence of Quasi-Hyperbolic Momentum using Increasing Batch Size30 Jun 2025
- 2025Enlightenment Period Improving DNN Performance2 Apr 2025
- 2025Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size30 Jan 2025
- 2025Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum15 Jan 2025