Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise
Kwangjun Ahn, Zhiyu Zhang, Yunbum Kook, Yan Dai
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper12
- Adam with model exponential moving average is effective for nonconvex optimizationKwangjun Ahn, Ashok CutkoskyNeurIPS 2024 · 被引用 36 次
- Discounted Adaptive Online Learning: Towards Better RegularizationZhiyu Zhang, David Bombara, Heng YangICML 2024 · 被引用 13 次
- Random Scaling and Momentum for Non-smooth Non-convex OptimizationQinzi Zhang, Ashok CutkoskyICML 2024 · 被引用 10 次
- Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double OptimismFrancisco Patitucci, Ruichen Jiang, Aryan MokhtariICLR 2026 · 被引用 3 次
- 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 次
它引用的顶会 Paper17
- Symbolic Discovery of Optimization AlgorithmsXiangning Chen, Chen Liang, Da Huang, Esteban Real 等NeurIPS 2023 · 被引用 734 次
- Why Gradient Clipping Accelerates Training: A Theoretical Justification for AdaptivityJingzhao Zhang, Tianxing He, Suvrit Sra, Ali JadbabaieICLR 2020 · 被引用 598 次
- Why are Adaptive Methods Good for Attention Models?Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim 等NeurIPS 2020 · 被引用 397 次
- Adam Can Converge Without Any Modification On Update RulesYushun Zhang, Congliang Chen, Naichen Shi, Ruoyu Sun 等NeurIPS 2022 · 被引用 134 次
- Convergence of Adam Under Relaxed AssumptionsHaochuan Li, Alexander Rakhlin, Ali JadbabaieNeurIPS 2023 · 被引用 132 次
相关 Paper
- 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 次
- Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré RecurrenceYun Kuen Cheung, Georgios PiliourasICML 2021 · 被引用 9 次
- Accelerated Regularized Learning in Finite N-Person GamesKyriakos Lotidis, Angeliki Giannou, Panayotis Mertikopoulos, Nicholas BambosNeurIPS 2024 · 被引用 3 次
- A new regret analysis for Adam-type algorithmsAhmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan CevherICML 2020 · 被引用 50 次
