Revisiting the Initial Steps in Adaptive Gradient Descent Optimization
Not on the map. Why?
Abstract (arXiv)
Adaptive gradient optimization methods, such as Adam, are prevalent in training deep neural networks across diverse machine learning tasks due to their ability to achieve faster convergence. However, these methods often suffer from suboptimal generalization compared to stochastic gradient descent (SGD) and exhibit instability, particularly when training Transformer models. In this work, we show the standard initialization of the second-order moment estimation (v0 =0) as a significant factor contributing to these limitations. We introduce simple yet effective solutions: initializing the second-order moment estimation with non-zero values, using either data-driven or random initialization strategies. Empirical evaluations demonstrate that our approach not only stabilizes convergence but also enhances the final performance of adaptive gradient optimizers. Furthermore, by adopting the proposed initialization strategies, Adam achieves performance comparable to many recently proposed variants of adaptive gradient optimization methods. Our code is available at https://github.com/Walleclipse/AdamInitialization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 47 references that are in the map. First posted on arXiv 3 Dec 2024.
Builds on
30 of 47 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2022Generative Adversarial Networkscited by 5,603
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
18 more
- 2019On the Convergence of Adam and Beyondcited by 834
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
- 2021Escaping the Big Data Paradigm with Compact Transformerscited by 261
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 136
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2023Scan and Snap: Understanding Training Dynamics and Token Composition in 1-layer Transformercited by 101
- 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 100
- 2018On the Convergence of Adaptive Gradient Methods for Nonconvex Optimizationcited by 91
- 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
- 2024Heavy-Tailed Class Imbalance and Why Adam Outperforms Gradient Descent on Language Modelscited by 78
- 2021On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs)cited by 73
- 2023Toward Understanding Why Adam Converges Faster Than SGD for Transformerscited by 50
- 2023No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Modelscited by 41
- 2019On the adequacy of untuned warmup for adaptive optimizationcited by 35
- 2022How Does Adaptive Optimization Impact Local Neural Network Geometry?cited by 24
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Bilevel Optimization of Topology and Hyperparameters (BOTH)18 Sep 2026