Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization

arXiv:2610.00254v1 Announce Type: new Abstract: We characterize the regret attainable in online convex optimization when access to the feasible set is limited to an exact linear optimization oracle. The learner is...