Step-size Adaptation Using Exponentiated Gradient Updates
Not on the map. Why?
Abstract (arXiv)
Optimizers like Adam and AdaGrad have been very successful in training large-scale neural networks. Yet, the performance of these methods is heavily dependent on a carefully tuned learning rate schedule. We show that in many large-scale applications, augmenting a given optimizer with an adaptive tuning method of the step-size greatly improves the performance. More precisely, we maintain a global step-size scale for the update as well as a gain factor for each coordinate. We adjust the global scale based on the alignment of the average gradient and the current gradient vectors. A similar approach is used for updating the local gain factors. This type of step-size scale tuning has been done before with gradient descent updates. In this paper, we update the step-size scale and the gain variables with exponentiated gradient updates instead. Experimentally, we show that our approach can achieve compelling accuracy on standard models without using any specially tuned learning rate schedule. We also show the effectiveness of our approach for quickly adapting to distribution shifts in the data during training.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 4 of its 27 references that are in the map. First posted on arXiv 31 Jan 2022.
Builds on
4 of 27 references.
References · 4
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
- 2019First-Order Preconditioning via Hypergradient Descentcited by 8
- 2019An Implicit Form of Krasulina's k-PCA Update without the Orthonormality Constraintcited by 4
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 2; 2025: 0; 2026: 1.
7 papers.
- 2023Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtrackingcited by 9
- 2023An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descentcited by 9
- 2024MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameterscited by 5
- 2022Learning to Optimize Quasi-Newton Methodscited by 3
- 2022Federated Hypergradient Descentcited by 2
- 2024A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methodscited by 0
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithmscited by 0
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithms21 Mar 2026
- 2024A Learn-to-Optimize Approach for Coordinate-Wise Step Sizes for Quasi-Newton Methods25 Nov 2024
- 2024MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters4 Feb 2024
- 2023An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent17 Oct 2023
- 2023Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking5 Jun 2023
- 2022Federated Hypergradient Descent3 Nov 2022
- 2022Learning to Optimize Quasi-Newton Methods11 Oct 2022