Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

4 June 2017

Papers citing "Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration"

13 / 13 papers shown

Title
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection Lijie Chen Jian Li Mingda Qiao 37 59 0 13 Feb 2017
Towards Instance Optimal Bounds for Best Arm Identification Lijie Chen Jian Li Mingda Qiao 58 56 0 22 Aug 2016
Quantile-based optimization under uncertainties using adaptive Kriging surrogate models M. Moustapha Bruno Sudret A. Locatelli B. Guillaume AI4CE 54 153 0 29 May 2016
An optimal algorithm for the Thresholding Bandit Problem A. Locatelli Maurilio Gutzeit Alexandra Carpentier 45 132 0 27 May 2016
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture Lijie Chen Jian Li 38 7 0 27 May 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints Lijie Chen Anupam Gupta Jian Li 62 49 0 23 May 2016
Maximin Action Identification: A New Bandit Framework for Games Aurélien Garivier E. Kaufmann Wouter M. Koolen 55 29 0 15 Feb 2016
Optimal Best Arm Identification with Fixed Confidence Aurélien Garivier E. Kaufmann 91 341 0 15 Feb 2016
On the Optimal Sample Complexity for Best Arm Identification Lijie Chen Jian Li 61 59 0 12 Nov 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 149 1,021 0 16 Jul 2014
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits Kevin Jamieson Matthew Malloy Robert D. Nowak Sébastien Bubeck 82 411 0 27 Dec 2013
Multiple Identifications in Multi-Armed Bandits Sébastien Bubeck Tengyao Wang N. Viswanathan 95 173 0 14 May 2012
Active sequential hypothesis testing Mohammad Naghshvar T. Javidi 72 233 0 20 Mar 2012