Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients
Not on the map. Why?
Abstract (arXiv)
Adam is widely observed to remain stable even when the objective deviates significantly from global smoothness. Under the generalized smoothness framework, however, existing analyses rely on strong tail assumptions on the stochastic gradients, such as almost-sure boundedness or sub-Gaussianity. Whether Adam converges on generalized smooth objectives under only second moment information on the stochastic gradients, without such concentration assumptions, was identified as an important open direction by Li et al. (2023). This paper gives an affirmative answer under fairly general conditions: such tail assumptions are not necessary. Building on the Adam self-normalization framework of Jin et al. (2026), developed for classical smoothness and bounded variance, we extend the stopping-time and de-preconditioning strategy to the L0-Lp generalized smoothness condition and a generalized second moment ABC condition. Even when the stochastic-gradient condition provides only second moment information that may grow along the trajectory, the stochastic trajectory of Adam remains in a locally well-behaved smoothness region, with stretched-exponential tail decay under bounded variance and global smoothness. Consequently, we establish high-probability convergence rate guarantees over the full range p<2, with confidence dependence of order δ-1/2, while the stepsize prefactor depends on δ only through a single logarithmic factor. We further construct a hard instance showing that, under only second-moment information, this δ-1/2-type confidence dependence is sharp. Finally, in the regime p<1, we combine the trajectory control with polynomial-growth estimates on rare events to obtain convergence rate guarantees in expectation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 38 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
35 of 38 references.
References · 35
- 2019On the Convergence of Adam and Beyondcited by 834
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 335
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 303
- 2019SGD: General Analysis and Improved Ratescited by 206
- 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 173
- 2020A Simple Convergence Proof of Adam and Adagradcited by 169
- 2020Better Theory for SGD in the Nonconvex Worldcited by 156
- 2018On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizescited by 155
- 2022Adam Can Converge Without Any Modification On Update Rulescited by 112
- 2020Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clippingcited by 104
23 more
- 2023Convergence of Adam Under Relaxed Assumptionscited by 97
- 2023Revisiting Gradient Clipping: Stochastic bias and tight convergence guaranteescited by 83
- 2021High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tailscited by 80
- 2022Robustness to Unbounded Smoothness of Generalized SignSGDcited by 80
- 2022The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variancecited by 60
- 2023High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variancecited by 60
- 2023Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptionscited by 55
- 2023High Probability Convergence of Stochastic Gradient Methodscited by 48
- 2023Convex and Non-convex Optimization Under Generalized Smoothnesscited by 44
- 2023Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexitycited by 38
- 2023Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimizationcited by 35
- 2020High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noisecited by 31
- 2022Provable Adaptivity of Adam under Non-uniform Smoothnesscited by 30
- 2024Methods for Convex (L0,L1)-Smooth Optimization: Clipping, Acceleration, and Adaptivitycited by 25
- 2024On Convergence of Adam for Stochastic Optimization under Relaxed Assumptionscited by 21
- 2024Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimizationcited by 16
- 2024Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variancecited by 14
- 2024On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyondcited by 13
- 2024A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGDcited by 9
- 2025On the O(frac√dK1/4) Convergence Rate of AdamW Measured by ℓ1 Normcited by 8
- 2026Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tailscited by 4
- 2024Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniquescited by 1
- 2025Convergence Analysis of the Last Iterate in Distributed Stochastic Gradient Descent with Momentumcited by 1
Built on by
Not cited yet.