Research map / Bandits and online learning / Online convex optimization and games
Online Convex Optimization with Hard Constraints: Towards the Best of Two Worlds and Beyond
Hengquan Guo, Xin Liu, Honghao Wei, Lei Ying
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 RECOO instead of Algorithm 1 in [30] | fixed-constraint COCO-Hard · synthetic fixed constraints | final cumulative violation: 0.23 -> 0.05 | Improved |
| use RECOO instead of Algorithm 2 in [30] | fixed-constraint COCO-Hard · synthetic fixed constraints | final cumulative violation: 0.16 -> 0.05 | Improved |
| use RECOO instead of Algorithm 1 in [35] | fixed-constraint COCO-Hard · synthetic fixed constraints | final cumulative violation: 980.64 -> 0.05 | Improved |
| use RECOO instead of Algorithm 1 in [30] | fixed-constraint COCO-Hard · synthetic fixed constraints | final cumulative loss: 507.17 -> 510.23 | Improved |
| use RECOO instead of Algorithm 1 in [35] | fixed-constraint COCO-Hard · synthetic fixed constraints | final cumulative loss: 504.81 -> 510.23 | Improved |
| use RECOO instead of Algorithm 1 in [31] | adversarial-constraint COCO-Hard · synthetic adversarial constraints | final cumulative violation: 1684.17 -> 713.45 | Improved |
| use RECOO instead of Algorithm 1 in [31] | adversarial-constraint COCO-Hard · synthetic adversarial constraints | final cumulative loss: 43011.29 -> 42510.14 | Improved |
| use RECOO instead of [31] and [32] | online job scheduling · distributed data center job scheduling | energy cost and delayed jobs | Improved |
Closest papers by meaning
- Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints (NeurIPS 2025 · similarity 0.92)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.91)
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.90)
- $O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization (NeurIPS 2025 · similarity 0.89)
- Projection-Free Online Convex Optimization with Time-Varying Constraints (ICML 2024 · similarity 0.89)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.89)
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.
