Fetching the paper…
Reading the bibliography…
We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}.
Gambling in a Rigged Casino: The Adversarial Multi-Armed Bandit problem
Auer, Peter, Cesa-Bianchi, Nicolò, Freund, Yoav, and Schapire, Robert · 1995
Earlier work this paper cites.
The space complexity of approximating the frequency moments
Alon, Noga, Matias, Yossi, and Szegedy, Mario · 1996
Earlier work this paper cites.
Pac bounds for multi-armed bandit and markov decision processes
Even-Dar, Eyal, Mannor, Shie, and Mansour, Yishay · 2002
Earlier work this paper cites.
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Mannor, S and Tsitsiklis, J N · 2004
Earlier work this paper cites.
A classification framework for anomaly detection
Steinwart, Ingo, Hush, Don R, and Scovel, Clint · 2005
Earlier work this paper cites.
Selecting among heuristics by solving thresholded k-armed bandit problems
Streeter, Matthew J and Smith, Stephen F · 2006
Earlier work this paper cites.
Pure exploration in multi-armed bandits problems
Bubeck, Sébastien, Munos, Rémi, and Stoltz, Gilles · 2009
Earlier work this paper cites.
Best arm identification in multi-armed bandits
Audibert, Jean-Yves and Bubeck, Sébastien · 2010
Cited alongside, same era.
Deviations of stochastic bandit regret
Salomon, Antoine and Audibert, Jean-Yves · 2011
Cited alongside, same era.
Challenging the empirical mean and empirical variance: a deviation study
Catoni, Olivier et al · 2012
Cited alongside, same era.
Best arm identification: A unified approach to fixed budget and fixed confidence
Gabillon, Victor, Ghavamzadeh, Mohammad, and Lazaric, Alessandro · 2012
Cited alongside, same era.
Pac subset selection in stochastic multi-armed bandits
Kalyanakrishnan, Shivaram, Tewari, Ambuj, Auer, Peter, and Stone, Peter · 2012
Cited alongside, same era.
Almost optimal exploration in multi-armed bandits
Karnin, Zohar, Koren, Tomer, and Somekh, Oren · 2013
Cited alongside, same era.
lil’ucb: An optimal exploration algorithm for multi-armed bandits
Jamieson, Kevin, Malloy, Matthew, Nowak, Robert, and Bubeck, Sébastien · 2014
Later among the works it cites.
Optimal pac multiple arm identification with applications to crowdsourcing
Zhou, Yuan, Chen, Xi, and Li, Jian · 2014
Later among the works it cites.
On top-k selection in multi-armed bandits and hidden bipartite graphs
Cao, Wei, Li, Jian, Tao, Yufei, and Li, Zhize · 2015
Later among the works it cites.
On the optimal sample complexity for best arm identification
Chen, Lijie and Li, Jian · 2015
Later among the works it cites.
On the complexity of best arm identification in multi-armed bandit models
Kaufmann, Emilie, Cappé, Olivier, and Garivier, Aurélien · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Combinatorial pure exploration of multi-armed bandits
Chen, Shouyuan, Lin, Tian, King, Irwin, Lyu, Michael R, and Chen, Wei · 2014
Cited alongside, same era.
Bandits with heavy tail
Bubeck, Sebastian, Cesa-Bianchi, Nicolo, and Lugosi, Gábor
Cited in the paper.
Multiple identifications in multi-armed bandits
Bubeck, Séebastian, Wang, Tengyao, and Viswanathan, Nitin
Cited in the paper.
Carpentier, Alexandra and Locatelli, Andrea · 2016
Closest in time.