$\tilde{O}(\sqrt{T})$ regret and polylogarithmic constraint violation for COCO in online convex optimization with adversarial costs and constraints
Read the original at arxiv.org→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\)...
Original headline: "$\tilde{O}(\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO"
Coverage timeline
- Oct 6, 04:00 UTC arXiv cs.LG lead source $\tilde{O}(\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO