> For the complete documentation index, see [llms.txt](https://agi.university/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://agi.university/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.