mlsanityData to 7 Oct 2026

Explainable Learning Rate Regimes for Stochastic Optimization

arXiv 2508.13639 ↗First posted 19 Aug 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Modern machine learning is trained by stochastic gradient descent (SGD), whose performance critically depends on how the learning rate (LR) is adjusted and decreased over time. Yet existing LR regimes may be intricate, or need to tune one or more additional hyper-parameters manually whose bottlenecks include huge computational expenditure, time and power in practice. This work, in a natural and direct manner, clarifies how LR should be updated automatically only according to the intrinsic variation of stochastic gradients. An explainable LR regime by leveraging stochastic second-order algorithms is developed, behaving a similar pattern to heuristic algorithms but implemented simply without any parameter tuning requirement, where it is of an automatic procedure that LR should increase (decrease) as the norm of stochastic gradients decreases (increases). The resulting LR regime shows its efficiency, robustness, and scalability in different classical stochastic algorithms, containing SGD, SGDM, and SIGNSGD, on machine learning tasks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 48 references that are in the map. First posted on arXiv 19 Aug 2025.

Builds on

17 of 48 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019On the Convergence of Adam and Beyondcited by 834
  3. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
  4. 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 283
  5. 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 218
  6. 2013Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimizationcited by 142
  7. 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
  8. 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 84
  9. 2014A Stochastic Quasi-Newton Method for Large-Scale Optimizationcited by 68
  10. 2021On the Convergence of Step Decay Step-Size for Stochastic Optimizationcited by 21
  11. 2018Tight Dimension Independent Lower Bound on the Expected Convergence Rate for Diminishing Step Sizes in SGDcited by 18
  12. 2014Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theorycited by 16
5 more
  1. 2024Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descentcited by 11
  2. 2022Neural-network solutions to stochastic reaction networkscited by 8
  3. 2021Explicit Convergence Rates of Greedy and Random Quasi-Newton Methodscited by 5
  4. 2024LoCo: Low-Bit Communication Adaptor for Large-scale Model Trainingcited by 5
  5. 2024Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Pointcited by 1

Built on by

Not cited yet.