Online Learning-guided Learning Rate Adaptation via Gradient Alignment
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- A simple uniformly optimal method without line search for convex optimizationMathematical Programming, 2025
- DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method2023
- Lower bounds for non-convex stochastic optimizationMathematical Programming, 2022
- Gradient Descent: The Ultimate Optimizer2022
- Stochastic Subgradient Method Converges on Tame FunctionsFoundations of Computational Mathematics, 2019
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic ProgrammingSIAM Journal on Optimization, 2013