Fetching the paper…
Reading the bibliography…
We propose a novel technique for analyzing adaptive sampling called the {\em Simulator}.
R. E. Bechhofer, “A sequential multiple-decision procedure for selecting the best one of several normal populations with a common unknown variance, and its use with various experimental designs,”
1958
Earlier work this paper cites.
T. L. Lai and H. Robbins, “Asymptotically efficient adaptive allocation rules,”
1985
Earlier work this paper cites.
S. Mannor and J. N. Tsitsiklis, “The sample complexity of exploration in the multi-armed bandit problem,”
2004
Earlier work this paper cites.
E. Even-Dar, S. Mannor, and Y. Mansour, “Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems,”
2006
Earlier work this paper cites.
R. M. Castro and R. D. Nowak, “Minimax bounds for active learning,”
2008
Earlier work this paper cites.
S. Hanneke, “Theoretical foundations of active learning,” 2009
2009
Earlier work this paper cites.
A. B. Tsybakov, “Introduction to nonparametric estimation. revised and extended from the 2004 french original. translated by vladimir zaiats,” 2009
2009
Earlier work this paper cites.
F. Nielsen and V. Garcia, “Statistical exponential families: A digest with flash cards,”
2009
Earlier work this paper cites.
Y. Yue and C. Guestrin, “Linear submodular bandits and their application to diversified retrieval,” in
2011
Earlier work this paper cites.
M. Raginsky and A. Rakhlin, “Lower bounds for passive and active learning,” in
2011
Earlier work this paper cites.
S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone, “Pac subset selection in stochastic multi-armed bandits,” in
2012
Earlier work this paper cites.
S. Bubeck and N. Cesa-Bianchi, “Regret analysis of stochastic and nonstochastic multi-armed bandit problems,”
2012
Earlier work this paper cites.
T. M. Cover and J. A. Thomas,
2012
Earlier work this paper cites.
E. Arias-Castro, E. J. Candes, and M. A. Davenport, “On the fundamental limits of adaptive sensing,”
2013
Cited alongside, same era.
Z. S. Karnin, T. Koren, and O. Somekh, “Almost optimal exploration in multi-armed bandits.”
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Soare, A. Lazaric, and R. Munos, “Best-arm identification in linear bandits,” in
2014
Cited alongside, same era.
A. Gopalan, S. Mannor, and Y. Mansour, “Thompson sampling for complex online problems.” 2014
2014
Cited alongside, same era.
R. M. Castro, “Adaptive sensing performance lower bounds for sparse signal detection and support estimation,”
L. Chen and J. Li, “On the optimal sample complexity for best arm identification,”
2015
Later among the works it cites.
E. Kaufmann, O. Cappé, and A. Garivier, “On the complexity of best arm identification in multi-armed bandit models,”
2015
Later among the works it cites.
T. Lattimore and C. Szepesvari, “The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits,”
2016
Later among the works it cites.
M. Simchowitz, K. Jamieson, and B. Recht, “Best-of-k-bandits,” in
2016
Later among the works it cites.
L. Chen, A. Gupta, and J. Li, “Pure exploration of multi-armed bandit under matroid constraints,” in
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
S. Chen, T. Lin, I. King, M. R. Lyu, and W. Chen, “Combinatorial pure exploration of multi-armed bandits,” in
2014
Cited alongside, same era.
2014
Cited alongside, same era.
S. Magureanu, R. Combes, and A. Proutiere, “Lipschitz bandits: Regret lower bound and optimal algorithms.” in
2014
Cited alongside, same era.
K. G. Jamieson, M. Malloy, R. D. Nowak, and S. Bubeck, “lil’ucb: An optimal exploration algorithm for multi-armed bandits.” in
2014
Cited alongside, same era.
M. Raginsky and I. Sason,
2014
Cited alongside, same era.
R. Combes, M. S. T. M. Shahi, A. Proutiere
2015
Cited alongside, same era.
2016
Later among the works it cites.
D. Russo, “Simple bayesian algorithms for best arm identification,” in
2016
Later among the works it cites.
2016
Later among the works it cites.
M. S. Talebi and A. Proutiere, “An optimal algorithm for stochastic matroid bandit optimization,” in
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Carpentier and A. Locatelli, “Tight (lower) bounds for the fixed budget best arm identification bandit problem,” in
2016
Later among the works it cites.
L. Chen, J. Li, and M. Qiao, “Nearly instance optimal sample complexity bounds for top-k arm selection,” 2017
2017
Closest in time.