Hindsight-Guided Momentum (HGM) Optimizer: An Approach to Adaptive Learning Rate
Not on the map. Why?
Abstract (arXiv)
We introduce Hindsight-Guided Momentum (HGM), a first-order optimization algorithm that adaptively scales learning rates based on the directional consistency of recent updates. Traditional adaptive methods, such as Adam or RMSprop , adapt learning dynamics using only the magnitude of gradients, often overlooking important geometric cues.Geometric cues refer to directional information, such as the alignment between current gradients and past updates, which reflects the local curvature and consistency of the optimization path. HGM addresses this by incorporating a hindsight mechanism that evaluates the cosine similarity between the current gradient and accumulated momentum. This allows it to distinguish between coherent and conflicting gradient directions, increasing the learning rate when updates align and reducing it in regions of oscillation or noise. The result is a more responsive optimizer that accelerates convergence in smooth regions of the loss surface while maintaining stability in sharper or more erratic areas. Despite this added adaptability, the method preserves the computational and memory efficiency of existing optimizers.By more intelligently responding to the structure of the optimization landscape, HGM provides a simple yet effective improvement over existing approaches, particularly in non-convex settings like that of deep neural network training.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 53 references that are in the map. First posted on arXiv 22 Jun 2025.
Builds on
22 of 53 references.
References · 22
- 2021Convex optimizationcited by 2,515
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,054
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2019On the Convergence of Adam and Beyondcited by 841
- 2019Introduction to Online Convex Optimizationcited by 803
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 674
- 2015Cyclical Learning Rates for Training Neural Networkscited by 629
- 2016Learning to learn by gradient descent by gradient descentcited by 620
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
10 more
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 142
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
- 2022Adam Can Converge Without Any Modification On Update Rulescited by 114
- 2018Closing the Generalization Gap of Adaptive Gradient Methods in Training Deep Neural Networkscited by 90
- 2015Natural Neural Networkscited by 44
Built on by
Citing papers per year: 2026: 2.
2 papers.