14 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR11 papers
- Université de LilleFR11 papers
- Centre de Recherche en InformatiqueFR9 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Centre Inria de l'Université de LilleFR2 papers
- École Centrale de LilleFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR2 papers
- Brno University of TechnologyCZ1 paper
- CentraleSupélecFR1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- College of Western IdahoUS1 paper
3 papers · 1 filter
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…
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…
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…