AI Paper Atlas

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

A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints

Hao Yu, Michael J. Neely

JMLR 2020 · Bandits and online learning › Online convex optimization and games · approach: Constrained and unconstrained OCO algorithms · 36 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
use the proposed drift-plus-penalty style algorithm instead of the earlier long-term-constraint algorithm with beta = 1/2Online convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runscumulative constraint violationImproved
use the proposed algorithm instead of the earlier algorithm with beta = 2/3Online convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runscumulative regretImproved
compare the proposed algorithm with the earlier O(sqrt(T)) regret algorithmOnline convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runscumulative regretNo clear effect
add the doubling trick so T need not be known (ablation)Proposed algorithm · Synthetic online linear loss, T=5000, 1000 runscumulative regretNo 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