mlsanityData to 7 Oct 2026

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size

arXiv 2402.05264 ↗First posted 7 Feb 2024cs.LG math.OCcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper presents a novel adaptation of the Stochastic Gradient Descent (SGD), termed AdaBatchGrad. This modification seamlessly integrates an adaptive step size with an adjustable batch size. An increase in batch size and a decrease in step size are well-known techniques to tighten the area of convergence of SGD and decrease its variance. A range of studies by R. Byrd and J. Nocedal introduced various testing techniques to assess the quality of mini-batch gradient approximations and choose the appropriate batch sizes at every step. Methods that utilized exact tests were observed to converge within O(LR2/varepsilon) iterations. Conversely, inexact test implementations sometimes resulted in non-convergence and erratic performance. To address these challenges, AdaBatchGrad incorporates both adaptive batch and step sizes, enhancing the method's robustness and stability. For exact tests, our approach converges in O(LR2/varepsilon) iterations, analogous to standard gradient descent. For inexact tests, it achieves convergence in O(maxlbrace LR2/varepsilon, σ2 R2/varepsilon2 rbrace ) iterations. This makes AdaBatchGrad markedly more robust and computationally efficient relative to prevailing methods. To substantiate the efficacy of our method, we experimentally show, how the introduction of adaptive step size and adaptive batch size gradually improves the performance of regular SGD. The results imply that AdaBatchGrad surpasses alternative methods, especially when applied to inexact tests.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 43 references that are in the map. First posted on arXiv 7 Feb 2024.

Builds on

28 of 43 references.

References · 28

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  2. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  3. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  4. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  5. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
  6. 2019SGD: General Analysis and Improved Ratescited by 206
  7. 2018Measuring the Effects of Data Parallelism on Neural Network Trainingcited by 190
  8. 2013Optimization, Learning, and Games with Predictable Sequencescited by 187
  9. 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
  10. 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 173
  11. 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
  12. 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 116
16 more
  1. 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
  2. 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
  3. 2019A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descentcited by 84
  4. 2016Scale-Free Online Learningcited by 83
  5. 2022Making SGD Parameter-Freecited by 50
  6. 2017Adaptive Sampling Strategies for Stochastic Optimizationcited by 29
  7. 2015Global convergence rate analysis of unconstrained optimization methods based on probabilistic modelscited by 27
  8. 2023Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reductioncited by 23
  9. 2021Stochastic Polyak Stepsize with a Moving Targetcited by 19
  10. 2022SP2: A Second Order Stochastic Polyak Methodcited by 13
  11. 2023Accelerated stochastic approximation with state-dependent noisecited by 8
  12. 2023Stochastic Gradient Descent with Preconditioned Polyak Step-sizecited by 7
  13. 2023SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithmscited by 5
  14. 2019Adaptive Gradient Descent for Convex and Non-Convex Stochastic Optimizationcited by 3
  15. 2020Adaptive Learning of the Optimal Batch Size of SGDcited by 3
  16. 2020Constrained and Composite Optimization via Adaptive Sampling Methodscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 0; 2026: 1.

3 papers.