Introduces the OCO-S² setting with stateful costs and sparse block communication, then derives dynamic regret bounds for projected block OGD and a prediction-augmented variant.
Wainwright , editor =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
OCO-S$^2$: Online Convex Optimization with Stateful Costs and Sparse Communication
Introduces the OCO-S² setting with stateful costs and sparse block communication, then derives dynamic regret bounds for projected block OGD and a prediction-augmented variant.