Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients
cs.AI
Submitted: 2026-09-29
Updated: 2026-10-05
Comments: 37 pages, 4 figures. Accepted at NeurIPS 2026
License: http://creativecommons.org/licenses/by-sa/4.0/
The gist: Adam is widely observed to remain stable even when the objective deviates significantly from global smoothness.
Terminology
Abstract
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 L 0 - L p 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.
Sources
- Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
- Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails
- On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems