The True Sample Complexity of Identifying Good Arms

15 June 2019

Papers citing "The True Sample Complexity of Identifying Good Arms"

13 / 13 papers shown

Title
On the Problem of Best Arm Retention Houshuang Chen Yuchen He Chihao Zhang 77 0 0 16 Apr 2025
Pure Exploration with Multiple Correct Answers Rémy Degenne Wouter M. Koolen 67 91 0 09 Feb 2019
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits A. Chaudhuri Shivaram Kalyanakrishnan 66 27 0 24 Jan 2019
A Bandit Approach to Multiple Testing with False Discovery Control Kevin Jamieson Lalit P. Jain 50 23 0 06 Sep 2018
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence Maryam Aziz J. Anderton E. Kaufmann J. Aslam 13 34 0 13 Mar 2018
Thresholding Bandits with Augmented UCB Subhojyoti Mukherjee K. P. Naveen N. Sudarsanam Balaraman Ravindran 43 23 0 07 Apr 2017
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime Max Simchowitz Kevin Jamieson Benjamin Recht 152 66 0 16 Feb 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection Lijie Chen Jian Li Mingda Qiao 70 61 0 13 Feb 2017
An optimal algorithm for the Thresholding Bandit Problem A. Locatelli Maurilio Gutzeit Alexandra Carpentier 65 135 0 27 May 2016
Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization Lisha Li Kevin Jamieson Giulia DeSalvo Afshin Rostamizadeh Ameet Talwalkar 242 2,336 0 21 Mar 2016
Simple regret for infinitely many armed bandits Alexandra Carpentier Michal Valko 236 89 0 18 May 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 209 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