Research map / Bandits and online learning / Online convex optimization and games
Online Convex Optimization with Continuous Switching Constraint
Guanghui Wang, Yuanyu Wan, Tianbao Yang, Lijun Zhang
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 |
|---|---|---|---|
| Tune the constant OGD step size to the switching budget | OGD on OCO-CSC with convex losses · OCO-CSC, convex; S∈[D√T,DT] | regret upper bound | Improved |
| Tune the constant OGD step size to the switching budget | OGD on OCO-CSC with convex losses · OCO-CSC, convex; S∈[D,D√T) | regret upper bound | Improved |
| Use a denominator offset c in the time-varying OGD step size | OGD on OCO-CSC with strongly convex losses · OCO-CSC, strongly convex; S∈[\frac{2G}{\lambda}\log(T+1),DT] | regret upper bound | Improved |
| Set the denominator offset c according to the switching budget | OGD on OCO-CSC with strongly convex losses · OCO-CSC, strongly convex; S∈[0,\frac{2G}{\lambda}\log(T+1)) | regret upper bound | Improved |
| Use classical OGD with a budget-calibrated step size instead of mini-batch OGD | OCO-CSC with convex losses · OCO-CSC, convex | regret upper bound | Improved |
| Adapt adversary epochs to cumulative switching cost | Lower-bound construction for OCO-CSC · OCO-CSC, convex | regret lower bound | Improved |
Closest papers by meaning
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.89)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.89)
- Dynamic Regret in Online Convex Optimization with Indicator Switching Costs (NeurIPS 2026 · similarity 0.88)
- Revisiting Projection-Free Online Learning with Time-Varying Constraints (AAAI 2025 · similarity 0.88)
- Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints (NeurIPS 2025 · similarity 0.88)
- An Equivalence Between Static and Dynamic Regret Minimization (NeurIPS 2024 · similarity 0.87)
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.
