an-algorithm-with-nearly-optimal-pseudo-regret-for-both-stochastic-and-adversarial-bandits.md

An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits

[24] P. Auer and C. Chao-Kai. An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits. In 29th Annual Conference on Learning Theory, 2016.