mlsanityData to 14 Oct 2026

How to Set β1, β2 in Adam: An Online Learning Perspective

arXiv 2510.03478 ↗First posted 3 Oct 2025cs.LG math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

While Adam is one of the most effective optimizer for training large-scale machine learning models, a theoretical understanding of how to optimally set its momentum factors, β1 and β2, remains largely incomplete. Prior works have shown that Adam can be seen as an instance of Follow-the-Regularized-Leader (FTRL), one of the most important class of algorithms in online learning. The prior analyses in these works required setting β1 = √β2, which does not cover the more practical cases with β1 neq √β2. We derive novel, more general analyses that hold for both β1 ≥ √β2 and β1 ≤ √β2. In both cases, our results strictly generalize the existing bounds. Furthermore, we show that our bounds are tight in the worst case. We also prove that setting β1 = √β2 is optimal for an oblivious adversary, but sub-optimal for an non-oblivious adversary.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 17 references that are in the map. First posted on arXiv 3 Oct 2025.

Builds on

15 of 17 references.

References · 15

  1. 2019On the Convergence of Adam and Beyondcited by 841
  2. 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 417
  3. 2022Adam Can Converge Without Any Modification On Update Rulescited by 114
  4. 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 45
  5. 2025In Search of Adam's Secret Saucecited by 40
  6. 2020A new regret analysis for Adam-type algorithmscited by 35
  7. 2015Scale-Free Algorithms for Online Linear Optimizationcited by 30
  8. 2024Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguisecited by 26
  9. 2024Adam with model exponential moving average is effective for nonconvex optimizationcited by 23
  10. 2024Random Scaling and Momentum for Non-smooth Non-convex Optimizationcited by 19
  11. 2024ADOPT: Modified Adam Can Converge with Any β2 with the Optimal Ratecited by 18
  12. 2024General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimizationcited by 15
3 more
  1. 2025The Rich and the Simple: On the Implicit Bias of Adam and SGDcited by 13
  2. 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worldscited by 11
  3. 2024A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGDcited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.