Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization
DGX agentarXiv:2607.25480v1 Announce Type: new Abstract: Constrained online convex optimization requires minimizing regret against adversarial convex costs while satisfying a convex constraint at every round,