SoftSignSGD(S3): An Enhanced Optimizer for Practical DNN Training and Loss Spikes Minimization Beyond Adam
Not on the map. Why?
Abstract (arXiv)
Adam has proven remarkable successful in training deep neural networks, but the mechanisms underlying its empirical successes and limitations remain underexplored. In this study, we demonstrate that the effectiveness of Adam stems largely from its similarity to SignSGD in robustly handling large gradient fluctuations, yet it is also vulnerable to destabilizing loss spikes due to its uncontrolled update scaling. To enhance the advantage of Adam and mitigate its limitation, we propose SignSoftSGD (S3), a novel optimizer with three key innovations. First, S3 generalizes the sign-like update by employing a flexible p-th order momentum (p ≥ 1) in the denominator, departing from the conventional second-order momentum (variance) preconditioning. This design enables enhanced performance while achieving stable training even with aggressive learning rates. Second, S3 minimizes the occurrences of loss spikes through unified exponential moving average coefficients for numerator and denominator momenta, which inherently bound updates to [-1, 1] and simplify hyperparameter tuning. Third, S3 incorporates an equivalent Nesterov's accelerated gradient(NAG) module, accelerating convergence without memory overhead. Theoretically, we prove that S3 achieves the optimal convergence rate of Oleft(frac1T^sfrac14right) for general nonconvex stochastic optimization under weak assumptions. Extensive experiments across a range of vision and language tasks show that textsfsmall S3 not only converges more rapidly and improves performance but also rarely experiences loss spikes, even with a textbfbm10 × larger learning rate. In fact, S3 delivers performance comparable to or better than AdamW with 2 × the training steps, establishing its efficacy in both efficiency and final task performance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 43 of its 58 references that are in the map. First posted on arXiv 9 Jul 2025.
Builds on
43 of 58 references.
References · 43
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Segment Anythingcited by 8,234
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2022A ConvNet for the 2020scited by 3,579
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
31 more
- 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 843
- 2019On the Convergence of Adam and Beyondcited by 841
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
- 2023ConvNeXt V2: Co-designing and Scaling ConvNets with Masked Autoencoderscited by 712
- 2023Baichuan 2: Open Large-scale Language Modelscited by 670
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
- 2020Understanding the Difficulty of Training Transformerscited by 210
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2020The Lipschitz Constant of Self-Attentioncited by 174
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2020A Simple Convergence Proof of Adam and Adagradcited by 171
- 2022Signal Propagation in Transformers: Theoretical Perspectives and the Role of Rank Collapsecited by 141
- 2017Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradientscited by 139
- 2022Adam Can Converge Without Any Modification On Update Rulescited by 114
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2023Convergence of Adam Under Relaxed Assumptionscited by 99
- 2022What Language Model to Train if You Have One Million GPU Hours?cited by 92
- 2024Heavy-Tailed Class Imbalance and Why Adam Outperforms Gradient Descent on Language Modelscited by 80
- 2019A Mean Field Theory of Batch Normalizationcited by 58
- 2023A Theory on Adam Instability in Large-Scale Machine Learningcited by 56
- 2023Lion Secretly Solves Constrained Optimization: As Lyapunov Predictscited by 51
- 2018Convergence guarantees for RMSProp and ADAM in non-convex optimization and an empirical comparison to Nesterov accelerationcited by 39
- 2023LipsFormer: Introducing Lipschitz Continuity to Vision Transformerscited by 34
- 2023Catapults in SGD: spikes in the training loss and their impact on generalization through feature learningcited by 31
- 2020Stochasticity of Deterministic Gradient Descent: Large Learning Rate for Multiscale Objective Functioncited by 26
- 2024On Convergence of Adam for Stochastic Optimization under Relaxed Assumptionscited by 21
- 2023Loss Spike in Training Neural Networkscited by 16
Built on by
Citing papers per year: 2026: 1.
1 paper.