Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails
Ruinan Jin, Yingbin Liang, and Shaofeng Zou

TL;DR
This paper provides a theoretical explanation for Adam's superior empirical convergence over SGD by analyzing second-moment normalization, showing Adam's better high-probability guarantees.
Contribution
It introduces a novel analysis revealing how second-moment normalization in Adam leads to sharper tail bounds compared to SGD.
Findings
Adam achieves a $oldsymbol{ extstyle rac{1}{ oot 2 ext{ of } oldsymbol{ ext{delta}}}}$ dependence on confidence
First theoretical separation between Adam and SGD in high-probability convergence
Adam's analysis under classical bounded variance model explains empirical performance gap
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 dependence on the confidence parameter , whereas corresponding high-probability guarantee for SGD necessarily incurs at least a dependence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
