AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

A new regret analysis for Adam-type algorithms

ICML 2020 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret · 22 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use constant β1 instead of a schedule decreasing to zeroAMSGrad · Online convex optimizationregret: O(√T)Helped
Use constant β1 instead of a schedule decreasing to zeroAdamNc · Online convex optimizationregret: O(√T)Helped
Use constant β1 instead of a schedule decreasing to zeroSadam · Strongly convex online optimizationregret: O(log T)Helped
Use constant β1 instead of β1t = β1/tZO-AdaMM · Convex zeroth-order optimizationexpected regret: O(√T)Helped
Use the new analysis instead of the prior nonconvex AMSGrad proofAMSGrad · Nonconvex stochastic optimizationaverage squared gradient norm: slightly better constantsHelped
Use a nonincreasing variable β1 schedule rather than constant β1Adam-type methods · Online convex optimizationregret-bound constants: 1/(1−β1)^2Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy