22 citations
- Afterschool AllianceUS2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Centre de Recherche en InformatiqueFR1 paper
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Cristal (United Kingdom)GB1 paper
- Criteo (France)FR1 paper
- Laboratoire Traitement et Communication de l’InformationFR1 paper
- Renault (France)FR1 paper
- Université de LilleFR1 paper
Showing 2020Show 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…
cs.IT2020
Optimal Strategies for Graph-Structured Bandits
Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard
We study a structured variant of the multi-armed bandit problem specified by a set of Bernoulli distributions with mean…
cs.LG2020★ 3 cited
Forced-exploration free Strategies for Unimodal Bandits
Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard
We consider a multi-armed bandit problem specified by a set of Gaussian or Bernoulli distributions endowed with a unimodal structure. Although this problem has been addressed in th…