mlsanityData to 7 Oct 2026

Training Deep Neural Networks with Adaptive Momentum Inspired by the Quadratic Optimization

arXiv 2110.09057 ↗First posted 18 Oct 2021cs.LG math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

Heavy ball momentum is crucial in accelerating (stochastic) gradient-based optimization algorithms for machine learning. Existing heavy ball momentum is usually weighted by a uniform hyperparameter, which relies on excessive tuning. Moreover, the calibrated fixed hyperparameter may not lead to optimal performance. In this paper, to eliminate the effort for tuning the momentum-related hyperparameter, we propose a new adaptive momentum inspired by the optimal choice of the heavy ball momentum for quadratic optimization. Our proposed adaptive heavy ball momentum can improve stochastic gradient descent (SGD) and Adam. SGD and Adam with the newly designed adaptive momentum are more robust to large learning rates, converge faster, and generalize better than the baselines. We verify the efficiency of SGD and Adam with the new adaptive momentum on extensive machine learning benchmarks, including image classification, language modeling, and machine translation. Finally, we provide convergence guarantees for SGD and Adam with the proposed adaptive momentum.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 29 of its 54 references that are in the map. First posted on arXiv 18 Oct 2021.

Builds on

29 of 54 references.

References · 29

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  5. 2016Identity Mappings in Deep Residual Networkscited by 1,960
  6. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  7. 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
  8. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  9. 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
  10. 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
  11. 2018On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizescited by 155
  12. 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
17 more
  1. 2016Katyusha: The First Direct Acceleration of Stochastic Gradient Methodscited by 134
  2. 2017Improving Generalization Performance by Switching from Adam to SGDcited by 121
  3. 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 116
  4. 2014Global convergence of the Heavy-ball method for convex optimizationcited by 60
  5. 2018A Unified Analysis of Stochastic Momentum Methods for Deep Learningcited by 54
  6. 2018Quasi-hyperbolic momentum and Adam for deep learningcited by 47
  7. 2019Understanding the Role of Momentum in Stochastic Gradient Methodscited by 42
  8. 2014iPiano: Inertial Proximal Algorithm for Non-Convex Optimizationcited by 30
  9. 2020On the Convergence of Nesterov's Accelerated Gradient Method in Stochastic Settingscited by 27
  10. 2020Scheduled Restart Momentum for Accelerated Stochastic Gradient Descentcited by 24
  11. 2016On the Influence of Momentum Acceleration on Online Learningcited by 23
  12. 2018On Acceleration with Noise-Corrupted Gradientscited by 20
  13. 2018Non-ergodic Convergence Analysis of Heavy-Ball Algorithmscited by 13
  14. 2019Heavy-ball Algorithms Always Escape Saddle Pointscited by 13
  15. 2018Robust Accelerated Gradient Methods for Smooth Strongly Convex Functionscited by 12
  16. 2019A Generic Acceleration Framework for Stochastic Composite Optimizationcited by 9
  17. 2020Stochastic Gradient Descent with Nonlinear Conjugate Gradient-Style Adaptive Momentumcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 1; 2024: 2; 2025: 0; 2026: 1.

8 papers.