A primal-dual framework with adaptive dual regularizer achieves O(√T) regret and O(√T log T) constraint violation for constrained OCO without Slater's condition under stochastic constraints, with extensions to adversarial constraints and strongly convex losses.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constrained Online Convex Optimization without Slater's Condition
A primal-dual framework with adaptive dual regularizer achieves O(√T) regret and O(√T log T) constraint violation for constrained OCO without Slater's condition under stochastic constraints, with extensions to adversarial constraints and strongly convex losses.