688 citations · 2k across the 44 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.ST2008★ 183 cited
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems
Aurélien Garivier, Eric Moulines
Multi-armed bandit problems are considered as a paradigm of the trade-off between exploring the environment to find profitable actions and exploiting what is already known. In the…
math.ST2008★ 28 cited
Coding on countably infinite alphabets
Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat
This paper describes universal lossless coding strategies for compressing sources on countably infinite alphabets. Classes of memoryless sources defined by an envelope condition on…