Minimax Alternating Regret for the Experts Problem and Online Convex Optimization
This story is from 2026-08-27. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2608.25182v1 Announce Type: new Abstract: In this paper, we study alternating regret in online convex optimization (OCO), motivated by the success of alternating learning dynamics in two-player games. Although previous works have shown that $o(\sqrt{T})$ alternating regret is achievable under…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-08-27 04:00 · arXiv stat.ML
Minimax Alternating Regret for the Experts Problem and Online Convex Optimization