Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1511.03774
Cited By
On the Optimal Sample Complexity for Best Arm Identification
12 November 2015
Lijie Chen
Jian Li
Re-assign community
ArXiv
PDF
HTML
Papers citing
"On the Optimal Sample Complexity for Best Arm Identification"
38 / 38 papers shown
Title
On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
Shubhada Agrawal
Aaditya Ramdas
29
0
0
28 Apr 2025
Active clustering with bandit feedback
Victor Thuot
Alexandra Carpentier
Christophe Giraud
Nicolas Verzélen
43
4
0
17 Jun 2024
Query-Efficient Correlation Clustering with Noisy Oracle
Yuko Kuroki
Atsushi Miyauchi
Francesco Bonchi
Wei Chen
26
2
0
02 Feb 2024
Optimal Batched Best Arm Identification
Tianyuan Jin
Yu Yang
Jing Tang
Xiaokui Xiao
Pan Xu
51
3
0
21 Oct 2023
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits
Chen Wang
27
5
0
03 Jun 2023
Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits
Evelyn Xiao-Yue Gong
Mark Sellke
37
1
0
03 Jun 2023
On Elimination Strategies for Bandit Fixed-Confidence Identification
Andrea Tirinzoni
Rémy Degenne
47
7
0
22 May 2022
Approximate Top-
m
m
m
Arm Identification with Heterogeneous Reward Variances
Ruida Zhou
Chao Tian
16
4
0
11 Apr 2022
Pure Exploration in Kernel and Neural Bandits
Yinglun Zhu
Dongruo Zhou
Ruoxi Jiang
Quanquan Gu
Rebecca Willett
Robert D. Nowak
13
15
0
22 Jun 2021
Variance-Dependent Best Arm Identification
P. Lu
Chao Tao
Xiaojin Zhang
70
10
0
19 Jun 2021
PAC Best Arm Identification Under a Deadline
Brijen Thananjeyan
Kirthevasan Kandasamy
Ion Stoica
Michael I. Jordan
Ken Goldberg
Joseph E. Gonzalez
10
4
0
06 Jun 2021
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Yuko Kuroki
Junya Honda
Masashi Sugiyama
OffRL
24
1
0
31 Dec 2020
Experimental Design for Regret Minimization in Linear Bandits
Andrew Wagenmaker
Julian Katz-Samuels
Kevin G. Jamieson
22
16
0
01 Nov 2020
Robust Outlier Arm Identification
Yinglun Zhu
S. Katariya
Robert D. Nowak
8
2
0
21 Sep 2020
Quantum exploration algorithms for multi-armed bandits
Daochen Wang
Xuchen You
Tongyang Li
Andrew M. Childs
38
27
0
14 Jul 2020
The Sample Complexity of Best-
k
k
k
Items Selection from Pairwise Comparisons
Wenbo Ren
Jia Liu
Ness B. Shroff
16
12
0
06 Jul 2020
Combinatorial Pure Exploration of Dueling Bandit
Wei Chen
Yihan Du
Longbo Huang
Haoyu Zhao
6
12
0
23 Jun 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits
Julian Katz-Samuels
Lalit P. Jain
Zohar Karnin
Kevin G. Jamieson
14
65
0
21 Jun 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem
J. Cheshire
Pierre Menard
Alexandra Carpentier
13
11
0
17 Jun 2020
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback
Yihan Du
Yuko Kuroki
Wei Chen
OffRL
13
4
0
14 Jun 2020
Quantile Multi-Armed Bandits: Optimal Best-Arm Identification and a Differentially Private Scheme
Konstantinos E. Nikolakakis
Dionysios S. Kalogerias
Or Sheffet
Anand D. Sarwate
18
11
0
11 Jun 2020
Near-Optimal Confidence Sequences for Bounded Random Variables
Arun K. Kuchibhotla
Qinqing Zheng
9
7
0
09 Jun 2020
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
Wenbo Ren
Jia Liu
Ness B. Shroff
27
19
0
07 Sep 2019
Sequential Experimental Design for Transductive Linear Bandits
Tanner Fiez
Lalit P. Jain
Kevin G. Jamieson
Lillian J. Ratliff
17
105
0
20 Jun 2019
Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback
Yuko Kuroki
Liyuan Xu
Atsushi Miyauchi
Junya Honda
Masashi Sugiyama
25
17
0
27 Feb 2019
Playing against Nature: causal discovery for decision making under uncertainty
Mauricio Gonzalez-Soto
L. Sucar
Hugo Jair Escalante
CML
13
9
0
03 Jul 2018
Best Arm Identification for Contaminated Bandits
Jason M. Altschuler
Victor-Emmanuel Brunel
Alan Malek
22
45
0
26 Feb 2018
Structured Best Arm Identification with Fixed Confidence
Ruitong Huang
Mohammad M. Ajallooeian
Csaba Szepesvári
Martin Müller
9
25
0
16 Jun 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
Lijie Chen
Anupam Gupta
Jiacheng Li
Mingda Qiao
Ruosong Wang
24
47
0
04 Jun 2017
Practical Algorithms for Best-K Identification in Multi-Armed Bandits
Haotian Jiang
Jian Li
Mingda Qiao
13
14
0
19 May 2017
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
Max Simchowitz
Kevin G. Jamieson
Benjamin Recht
10
66
0
16 Feb 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
Lijie Chen
Jian Li
Mingda Qiao
15
58
0
13 Feb 2017
Identifying Best Interventions through Online Importance Sampling
Rajat Sen
Karthikeyan Shanmugam
A. Dimakis
Sanjay Shakkottai
36
72
0
10 Jan 2017
Towards Instance Optimal Bounds for Best Arm Identification
Lijie Chen
Jian Li
Mingda Qiao
13
54
0
22 Aug 2016
Quantile-based optimization under uncertainties using adaptive Kriging surrogate models
M. Moustapha
Bruno Sudret
A. Locatelli
B. Guillaume
AI4CE
19
152
0
29 May 2016
An optimal algorithm for the Thresholding Bandit Problem
A. Locatelli
Maurilio Gutzeit
Alexandra Carpentier
11
132
0
27 May 2016
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture
Lijie Chen
Jian Li
11
7
0
27 May 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
Lijie Chen
Anupam Gupta
Jian Li
27
49
0
23 May 2016
1