AI Paper Atlas

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

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization

Sijia Chen, Wei-Wei Tu, Peng Zhao, Lijun Zhang

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
convexity assumption moved from individual functions to expected functions in optimistic OMDoptimistic OMD on SEA convex smooth · SEA convex smoothexpected static regretNo clear effect
refined log-variation analysis for strongly convex caseoptimistic OMD strongly convex smooth · SEA strongly convex smoothexpected static regretImproved
two-layer ensemble with correction terms for dynamic regretoptimistic OMD convex smooth · SEA convex smooth dynamic regretexpected dynamic regretImproved
implicit update in optimistic step (non-smooth functions)optimistic OMD convex non-smooth · SEA convex non-smooth static regretexpected static regretMixed
alternative optimism design using gradient at averaged decision (Sachs et al. style) (ablation)two-layer dynamic regret algorithm · SEA smooth dynamic regretexpected dynamic regretHurt

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