Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
Kwangjun Ahn, Zhiyu Zhang, Yunbum Kook, Yan Dai
Abstract
Despite the success of the Adam optimizer in practice, the theoretical understanding of its algorithmic components still remains limited. In particular, most existing analyses of Adam show the convergence rate that can be simply achieved by nonadative algorithms like SGD. In this work, we provide a different perspective based on online learning that underscores the importance of Adam's algorithmic components. Inspired by Cutkosky et al. ( 2023 ), we consider the framework called online learning of updates/increments, where we choose the updates/increments of an optimizer based on an online learner. With this framework, the design of a good optimizer is reduced to the design of a good online learner. Our main observation is that Adam corresponds to a principled online learning framework called Follow-the-Regularized-Leader (FTRL). Building on this observation, we study the benefits of its algorithmic components from the online learning perspective.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 99d606ef-0988-4d7a-8344-013f3d7c7fd2Cited by top-tier papers12
- Adam with model exponential moving average is effective for nonconvex optimizationKwangjun Ahn, Ashok CutkoskyNeurIPS 2024 · 36 citations
- Discounted Adaptive Online Learning: Towards Better RegularizationZhiyu Zhang, David Bombara, Heng YangICML 2024 · 13 citations
- Random Scaling and Momentum for Non-smooth Non-convex OptimizationQinzi Zhang, Ashok CutkoskyICML 2024 · 10 citations
- Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double OptimismFrancisco Patitucci, Ruichen Jiang, Aryan MokhtariICLR 2026 · 3 citations
- Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam OptimizerYan-Feng Xie, Yu-Jie Zhang, Peng Zhao, Zhi-Hua ZhouICML 2026 · 2 citations
Builds on17
- Symbolic Discovery of Optimization AlgorithmsXiangning Chen, Chen Liang, Da Huang, Esteban Real et al.NeurIPS 2023 · 734 citations
- Why Gradient Clipping Accelerates Training: A Theoretical Justification for AdaptivityJingzhao Zhang, Tianxing He, Suvrit Sra, Ali JadbabaieICLR 2020 · 598 citations
- Why are Adaptive Methods Good for Attention Models?Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim et al.NeurIPS 2020 · 397 citations
- Adam Can Converge Without Any Modification On Update RulesYushun Zhang, Congliang Chen, Naichen Shi, Ruoyu Sun et al.NeurIPS 2022 · 134 citations
- Convergence of Adam Under Relaxed AssumptionsHaochuan Li, Alexander Rakhlin, Ali JadbabaieNeurIPS 2023 · 132 citations
Related papers
- On the Dynamic Regret of Following the Regularized Leader: Optimism with History PruningNaram Mhaisen, George IosifidisICML 2025
- Generalized Implicit Follow-The-Regularized-LeaderKeyi Chen, Francesco OrabonaICML 2023 · 3 citations
- Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré RecurrenceYun Kuen Cheung, Georgios PiliourasICML 2021 · 9 citations
- Accelerated Regularized Learning in Finite N-Person GamesKyriakos Lotidis, Angeliki Giannou, Panayotis Mertikopoulos, Nicholas BambosNeurIPS 2024 · 3 citations
- A new regret analysis for Adam-type algorithmsAhmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan CevherICML 2020 · 50 citations
