Optimal Alternating Regret for Online Learning and Games
This story is from 2026-08-26. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2608.24731v1 Announce Type: cross Abstract: We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimization (OLO) and online convex optimization (OCO). For OLO over the probability simplex $\Delta_d$, w…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-08-26 04:00 · arXiv stat.ML
Optimal Alternating Regret for Online Learning and Games