$\tilde{O}(\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO
arXiv:2610.03983v1 Announce Type: new Abstract: We study constrained online convex optimization with adversarial convex losses and constraints ($\mathsf{COCO}$). At each round \(t\in[T]\), a learner selects \(x_t\) from a \(d\)-dimensional convex decision set \(\mathcal X\), after which an adaptive…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-10-06 04:00 · arXiv cs.LG
$\tilde{O}(\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO