Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection

13 February 2017

Papers citing "Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection"

4 / 4 papers shown

Title
Sequential Learning of the Pareto Front for Multi-objective Bandits Elise Crépon Aurélien Garivier Wouter M. Koolen 82 5 0 29 Jan 2025
On the Optimal Sample Complexity for Best Arm Identification Lijie Chen Jian Li 92 60 0 12 Nov 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 204 1,028 0 16 Jul 2014
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits Kevin Jamieson Matthew Malloy Robert D. Nowak Sébastien Bubeck 84 417 0 27 Dec 2013