Adaptive Heavy-Tailed Stochastic Gradient Descent
Not on the map. Why?
Abstract (arXiv)
In the era of large-scale neural network models, optimization algorithms often struggle with generalization due to an overreliance on training loss. One key insight widely accepted in the machine learning community is the idea that wide basins (regions around a local minimum where the loss increases gradually) promote better generalization by offering greater stability to small changes in input data or model parameters. In contrast, sharp minima are typically more sensitive and less stable. Motivated by two key empirical observations - the inherent heavy-tailed distribution of gradient noise in stochastic gradient descent and the Edge of Stability phenomenon during neural network training, in which curvature grows before settling at a plateau, we introduce Adaptive Heavy Tailed Stochastic Gradient Descent (AHTSGD). The algorithm injects heavier-tailed noise into the optimizer during the early stages of training to enhance exploration and gradually transitions to lighter-tailed noise as sharpness stabilizes. By dynamically adapting to the sharpness of the loss landscape throughout training, AHTSGD promotes accelerated convergence to wide basins. AHTSGD is the first algorithm to adjust the nature of injected noise into an optimizer based on the Edge of Stability phenomenon. AHTSGD consistently outperforms SGD and other noise-based methods on benchmarks like MNIST and CIFAR-10, with marked gains on noisy datasets such as SVHN. It ultimately accelerates early training from poor initializations and improves generalization across clean and noisy settings, remaining robust to learning rate choices.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 25 references that are in the map. First posted on arXiv 29 Aug 2025.
Builds on
15 of 25 references.
References · 15
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
- 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 145
- 2023Energy-based learning algorithms for analog computing: a comparative studycited by 37
- 2016A consensus-based model for global optimization and its mean-field limitcited by 21
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise and H"older Smoothness11 Sep 2026
- 2026Marginals Before Conditionals10 Mar 2026