atlas

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

Adaptive Algorithms for Online Convex Optimization with Long-term Constraints

ICML 2016 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 82 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
Adaptive step sizes with trade-off beta tuned to 2/3 (vs. beta=1/2)A-OGD for OCO with long-term constraints · theoryregret exponents (loss, constraint)Mixed
Strongly convex instead of convex losses in A-OGD (ablation)A-OGD on doubly-stochastic matrix experiment · doubly-stochastic matrices, T=1000cumulative regret on loss and constraintNo clear effect
Adaptive A-OGD vs. Convex OGD step sizes on elastic-net sparse classificationA-OGD · sparse online binary classification (ijcnn1, covtype)cumulative regret on lossHelped
Adding a penalty-free no-violation extension with gamma = c1 T^{-beta/2} tighteningA-OGD with extra gradient condition · theory (Corollary 1)constraint violationHelped

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