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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use the proposed drift-plus-penalty style algorithm instead of the earlier long-term-constraint algorithm with beta = 1/2 | Online convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runs | cumulative constraint violation | Improved |
| use the proposed algorithm instead of the earlier algorithm with beta = 2/3 | Online convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runs | cumulative regret | Improved |
| compare the proposed algorithm with the earlier O(sqrt(T)) regret algorithm | Online convex optimization with long term constraints · Synthetic online linear loss, T=5000, 1000 runs | cumulative regret | No clear effect |
| add the doubling trick so T need not be known (ablation) | Proposed algorithm · Synthetic online linear loss, T=5000, 1000 runs | cumulative regret | No clear effect |
Closest papers by meaning
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.91)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.91)
- Projection-Free Online Convex Optimization with Time-Varying Constraints (ICML 2024 · similarity 0.91)
- $O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization (NeurIPS 2025 · similarity 0.91)
- Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints (NeurIPS 2025 · similarity 0.90)
- Constrained Online Convex Optimization with Polyak Feasibility Steps (ICML 2025 · similarity 0.90)
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.
