A Geometric Approach to Constrained Online Learning

We study constrained online convex optimization with adversarial time-varying constraints. At each round the learner acts before observing the loss and constraint, and is compared with the best fixed action satisfying all constraints in hindsight. The goal is to obtain minimax-optimal regret while controlling cumulative constraint violation (CCV). Prior algorithms achieved O(log T) regret with O(√Tlog T) CCV for strongly convex losses, and O(√T) regret with O(√Tlog T) CCV for convex losses. We present NP-OGD, an iterated nested-projection algorithm. For strongly convex losses it achieves O(log T) regret and O(log T) CCV; for convex losses it achieves O(√T) regret and O(√T) CCV. The analysis relies on a geometric movement bound: after lifting the nested projected-gradient trajectory to one higher dimension, the lifted path is self-contracted under a nonstandard norm, so a finite-length theorem for self-contracted curves controls the total projection movement. We also prove complementary lower bounds using layered sphere packings. For strongly convex losses, any online algorithm with polynomially sublinear regret can incur CCV at least Omega((log T)(d-1)/(d+1)/loglog T). For convex losses, we prove CCV lower bounds Omega(T(d-1)/(2(d+3))) for weakly adaptive algorithms and Omega(T(d-1)/(2d)) for NP-OGD. Finally, for the constrained experts special case over N experts, an active Hedge algorithm attains O(√Tlog N) regret and O(N) CCV, with a matching minimax CCV lower bound for sufficiently large horizons.