Non-Asymptotic Pure Exploration by Solving Games

Non-Asymptotic Pure Exploration by Solving Games

25 June 2019

Wouter M. Koolen

Pierre Ménard

Papers citing "Non-Asymptotic Pure Exploration by Solving Games"

8 / 8 papers shown

Title
Sequential Learning of the Pareto Front for Multi-objective Bandits Elise Crépon Aurélien Garivier Wouter M. Koolen 62 2 0 29 Jan 2025
Best-Arm Identification in Unimodal Bandits Riccardo Poiani Marc Jourdan E. Kaufmann Rémy Degenne 130 0 0 04 Nov 2024
Optimal Multi-Fidelity Best-Arm Identification Riccardo Poiani Rémy Degenne Emilie Kaufmann Alberto Maria Metelli Marcello Restelli 108 1 0 05 Jun 2024
Optimal Batched Best Arm Identification Tianyuan Jin Yu Yang Jing Tang Xiaokui Xiao Pan Xu 68 3 0 21 Oct 2023
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners Mohammadi Zaki Avinash Mohan Aditya Gopalan 109 9 0 13 Jun 2020
An optimal algorithm for the Thresholding Bandit Problem A. Locatelli Maurilio Gutzeit Alexandra Carpentier 45 132 0 27 May 2016
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 152 1,021 0 16 Jul 2014
Optimization, Learning, and Games with Predictable Sequences Alexander Rakhlin Karthik Sridharan 74 377 0 08 Nov 2013