Skip to content
Sagan

Paper

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback

Unreadunread

AI summary

arXiv:2605. 26373v1 Announce Type: cross Abstract: We study adversarial online learning with hidden-convex losses, i.