ilde{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 (tin[T]), a learner selects