cs.LGMar 3, 2026

Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails

Authors: Ruinan Jin, Yingbin Liang, Shaofeng Zou

Organizations: Department of Electrical and Computer Engineering, The Ohio State University, USA · School of Electrical, Computer and Energy Engineering, Arizona State University, USA

Abstract

Despite Adam demonstrating faster empirical convergence than SGD in many applications, much of the existing theory yields guarantees essentially comparable to those of SGD, leaving the empirical performance gap insufficiently explained. In this paper, we uncover a key second-moment normalization in Adam and develop a stopping-time/martingale analysis that provably distinguishes Adam from SGD under the classical bounded variance model (a second moment assumption). In particular, we establish the first theoretical separation between the high-probability convergence behaviors of the two methods: Adam achieves a δ−1/2δ^{-1/2} dependence on the confidence parameter δδ, whereas corresponding high-probability guarantee for SGD necessarily incurs at least a δ−1δ^{-1} dependence.

Figures & tables

Explore similar work

CardsList
  1. Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization

    May 5, 2026Sharan Sahu, Abir Sarkar, Cameron J. Hogan +1Stochastic OptimizationStochastic Optimization Convergence

  2. Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients

    Sep 29, 2026Ruinan Jin, Difei Cheng, Ling Chen +3Convergence AnalysisStochastic Optimization Convergence