AI Paper Atlas

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

On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems

AAAI 2021 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret · 15 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 positive-definite preconditioning with one gradient query per roundOPGD · Unconstrained strongly convex and smooth online optimizationdynamic regret upper bound: O(C^*_{2,T})Helped
Use accurate predictions of the gradient and HessianOON · Unconstrained strongly convex and smooth online optimizationdynamic regret upper bound: O(D'_T+C^*_{4,T})Helped
Use stale previous-round gradient and Hessian information instead of accurate predictions (ablation)OON · Unconstrained strongly convex and smooth online optimizationdynamic regret upper bound: O(C^*_{2,T})Mixed
Use multiple gradient descents per roundOMGD · Unconstrained strongly convex and smooth online optimizationdynamic regret upper bound: O(min {V_T, C^*_{2,T}})Helped
Use the identity preconditioner, yielding ordinary OGD (ablation)OPGD · Unconstrained strongly convex and smooth online optimizationdynamic regret upper bound: O(C_{2,T}^*)No clear effect

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