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

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 given an inscribed ball and a diameter bound and must remain feasible on every consistent instance. For convex G-Lipschitz losses, diameter at most D, a total allowance of Q oracle calls, and a strict limit of B calls per round, the dimension-free minimax expected regret is Theta(GDmax√ T,T/(1+minQ,BT)1/4). The lower bound applies to arbitrary randomized learners. Universal feasibility first forces each action into the hull of the supplied ball and the preceding oracle replies. A fixed-body construction then couples fresh phase directions to a shared simplex, making useful replies costly repeatedly even though all losses have a common minimizer. A counted approximate-gradient method with interleaved blocks attains the matching rate. Total-budget and strict per-round guarantees follow as special cases, including the T3/4 rate with one call per round and the quadratic total budget needed for √ T regret. For prescribed smoothness β, an analytic construction yields a curvature-dependent lower bound and identifies the threshold above which the general characterization remains sharp.