Pith. sign in

REVIEW 2 cited by

Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.01567 v2 pith:7QNEXJ3M submitted 2024-02-02 cs.LG math.OC

classification cs.LGmath.OC
keywords onlineadamlearningoptimizeralgorithmiccomponentsframeworkupdates
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 non-adative 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stochastic Non-Smooth Convex Optimization with Unbounded Gradients

    math.OC 2026-05 unverdicted novelty 8.0 of 10

    Introduces generalized Lipschitz class and shows clipped AdamW outperforms SGD and AdaGrad for stochastic convex optimization under this and related assumptions.

  2. Stochastic Non-Smooth Convex Optimization with Unbounded Gradients

    math.OC 2026-05 unverdicted novelty 7.0 of 10

    Clipped AdamW with exponentially weighted accumulation achieves superior global convergence rates for convex stochastic generalized Lipschitz optimization compared to SGD and AdaGrad.

Pith tools