A modular algorithm for online convex-concave optimization achieves near-optimal dynamic duality gap bounds by combining adaptive experts with a multi-predictor aggregator.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
A modular algorithm for online convex-concave optimization achieves near-optimal dynamic duality gap bounds by combining adaptive experts with a multi-predictor aggregator.