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"

3 / 3 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
On the Optimal Sample Complexity for Best Arm Identification Lijie Chen Jian Li 66 59 0 12 Nov 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 154 1,021 0 16 Jul 2014