131 citations · 131 across the 1 of their papers we have counts for
1 paper
Sebastien Bubeck, Aleksandrs Slivkins
We present a new bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specific…