Online Learning-guided Learning Rate Adaptation via Gradient Alignment
Not on the map. Why?
Abstract (arXiv)
The performance of an optimizer on large-scale deep learning models depends critically on fine-tuning the learning rate, often requiring an extensive grid search over base learning rates, schedules, and other hyperparameters. In this paper, we propose a principled framework called GALA (Gradient Alignment-based Learning rate Adaptation), which dynamically adjusts the learning rate by tracking the alignment between consecutive gradients and using a local curvature estimate. Guided by the convergence analysis, we formulate the problem of selecting the learning rate as a one-dimensional online learning problem. When paired with an online learning algorithm such as Follow-the-Regularized-Leader, our method produces a flexible, adaptive learning rate schedule that tends to increase when consecutive gradients are aligned and decrease otherwise. We establish a data-adaptive convergence rate for normalized SGD equipped with GALA in the smooth, nonconvex setting. Empirically, common optimizers such as SGD and Adam, when augmented with GALA, demonstrate robust performance across a wide range of initial learning rates and perform competitively without the need for tuning.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 28 of its 43 references that are in the map. First posted on arXiv 10 Jun 2025.
Builds on
28 of 43 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
- 2018On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizescited by 156
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 118
- 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
- 2019Adaptive Gradient Descent without Descentcited by 79
- 2019The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squarescited by 68
- 2020A High Probability Analysis of Adaptive SGD with Momentumcited by 61
- 2022The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variancecited by 61
16 more
- 2019UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimizationcited by 56
- 2018Online Adaptive Methods, Universality and Accelerationcited by 51
- 2022Making SGD Parameter-Freecited by 50
- 2023High Probability Convergence of Stochastic Gradient Methodscited by 49
- 2023Optimal Linear Decay Learning Rate Schedules and Further Refinementscited by 43
- 2022High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsizecited by 40
- 2017Online to Offline Conversions, Universality and Adaptive Minibatch Sizescited by 39
- 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
- 2023Adaptive Proximal Gradient Method for Convex Optimizationcited by 21
- 2023Mechanic: A Learning Rate Tunercited by 20
- 2023A simple uniformly optimal method without line search for convex optimizationcited by 18
- 2022On the Convergence of AdaGrad(Norm) on Rd: Beyond Convexity, Non-Asymptotic Rate and Accelerationcited by 13
- 2024How Free is Parameter-Free Stochastic Optimization?cited by 12
- 2024Gradient Methods with Online Scalingcited by 11
- 2024MADA: Meta-Adaptive Optimizers through hyper-gradient Descentcited by 6
- 2025Provable and Practical Online Learning Rate Adaptation with Hypergradient Descentcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026AdamX: Cosine similarity meets gradient descentcited by 0
- 2026AdamX: Cosine similarity meets gradient descent10 Sep 2026