Trading Off Resource Budgets for Improved Regret Bounds

Damon Falck, Thomas Orton

In this work we consider a variant of adversarial online learning where in each round one picks $B$ out of $N$ arms and incurs cost equal to the $\text{minimum}$ of the costs of…