11 citations
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR7 papers
- Centre de Recherche en InformatiqueFR6 papers
- Université de LilleFR6 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- École Centrale de LilleFR2 papers
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR2 papers
- CentraleSupélecFR1 paper
- Centre Inria de l'Université de LilleFR1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- College of Western IdahoUS1 paper
- École Normale Supérieure Paris-SaclayFR1 paper
- École Normale Supérieure - PSLFR1 paper
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2020★ 5 cited
Sub-sampling for Efficient Non-Parametric Bandit Exploration
Dorian Baudry, Emilie Kaufmann, Odalric-Ambrym Maillard
In this paper we propose the first multi-armed bandit algorithm based on re-sampling that achieves asymptotically optimal regret simultaneously for different families of arms (name…
stat.ML2019★ 9 cited
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling
Cindy Trinh, Emilie Kaufmann, Claire Vernade +1
Stochastic Rank-One Bandits (Katarya et al, (2017a,b)) are a simple framework for regret minimization problems over rank-one matrices of arms. The initially proposed algorithms are…
stat.ML2017★ 11 cited
Monte-Carlo Tree Search by Best Arm Identification
Emilie Kaufmann, Wouter Koolen
Recent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related pro…