atlas

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

A Simple yet Universal Strategy for Online Convex Optimization

ICML 2022 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms

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
Replace per-type surrogate losses with black-box experts run on original functions, aggregated by Adapt-ML-Prod meta-algorithm over linearized losses (USC)online convex optimization with strongly convex functions · synthetic online convex problems (Figure 1a)regretHelped
Replace per-type surrogate losses with black-box experts run on original functions, aggregated by Adapt-ML-Prod meta-algorithm over linearized losses (USC)online convex optimization with general convex functions · synthetic online convex problems (Figure 1b)regretHelped
Use a geometric grid of O(log T) candidate strong-convexity/exp-concavity values for expertsUSC expert construction · theoretical analysisregret overheadNo 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