Optimally Pacing Budget Spending and Learning

Mark Braverman, Jingyi Liu, Jieming Mao +2

We establish near-optimal regret bounds for budget-constrained online learning against arbitrary classes of budget-pacing experts in the adversarial setting. In particular, given a…