55 citations · 121 across the 18 of their papers we have counts for
1 paper · 1 filter
Sébastien Gerchinovitz, Tor Lattimore
We provide new lower bounds on the regret that must be suffered by adversarial bandit algorithms. The new results show that recent upper bounds that either (a) hold with high-proba…