Fetching the paper…
Reading the bibliography…
In this paper, we study the multi-armed bandit problem in the batched setting where the employed policy must split data into a small number of batches.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
William R Thompson · 1933
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
A sequential design for the two armed bandit
Walter Vogel · 1960
Earlier work this paper cites.
Parallelism in comparison problems
Leslie G Valiant · 1975
Earlier work this paper cites.
Parallel sorting
Béla Bollobás and Andrew Thomason · 1983
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadii Semenovich Nemirovsky and David Borisovich Yudin · 1983
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Tze Leung Lai and Herbert Robbins · 1985
Earlier work this paper cites.
Sorting, approximate sorting, and searching in rounds
Noga Alon and Yossi Azar · 1988
Earlier work this paper cites.
Computing with noisy information
Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal · 1994
Earlier work this paper cites.
Optimal adaptive policies for markov decision processes
Apostolos N Burnetas and Michael N Katehakis · 1997
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
Elements of Information Theory
Thomas M. Cover and Joy A. Thomas · 2006
Earlier work this paper cites.
Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
Eyal Even-Dar, Shie Mannor, and Yishay Mansour · 2006
Cited alongside, same era.
A learning approach for interactive marketing to a customer segment
Dimitris Bertsimas and Adam J Mersereau · 2007
Cited alongside, same era.
Crowdsourcing user studies with mechanical turk
Aniket Kittur, Ed H Chi, and Bongwon Suh · 2008
Cited alongside, same era.
Introduction to Nonparametric Estimation
A. Tsybakov · 2008
Cited alongside, same era.
Minimax policies for adversarial and stochastic bandits
Jean-Yves Audibert and Sébastien Bubeck · 2009
Cited alongside, same era.
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Jean-Yves Audibert, Rémi Munos, and Csaba Szepesvári · 2009
Cited alongside, same era.
Bounded regret in stochastic multi-armed bandits
Sébastien Bubeck, Vianney Perchet, and Philippe Rigollet · 2013
Later among the works it cites.
Online learning with switching costs and other adaptive adversaries
Nicolo Cesa-Bianchi, Ofer Dekel, and Ohad Shamir · 2013
Later among the works it cites.
The multi-armed bandit problem with covariates
Vianney Perchet and Philippe Rigollet · 2013
Later among the works it cites.
On the complexity of bandit and derivative-free stochastic convex optimization
Ohad Shamir · 2013
Later among the works it cites.
Top-k and clustering with noisy comparisons
Susan Davidson, Sanjeev Khanna, Tova Milo, and Sudeepa Roy · 2014
Later among the works it cites.
Parallel algorithms for select and partition with noisy comparisons
Mark Braverman, Jieming Mao, and S Matthew Weinberg · 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…
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter L Bartlett, and Pradeep K Ravikumar · 2009
Cited alongside, same era.
Economic analysis of simulation selection problems
Stephen E Chick and Noah Gans · 2009
Cited alongside, same era.
Regret bounds and minimax policies under partial monitoring
Jean-Yves Audibert and Sébastien Bubeck · 2010
Cited alongside, same era.
UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem
Peter Auer and Ronald Ortner · 2010
Cited alongside, same era.
The kl-ucb algorithm for bounded stochastic bandits and beyond
Aurélien Garivier and Olivier Cappé · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
Top arm identification in multi-armed bandits with batch arm pulls
Kwang-Sung Jun, Kevin G Jamieson, Robert D Nowak, and Xiaojin Zhu · 2016
Later among the works it cites.
Batched bandit problems
Vianney Perchet, Philippe Rigollet, Sylvain Chassang, and Erik Snowberg · 2016
Later among the works it cites.
Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons
Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, and Sanjeev Khanna · 2017
Later among the works it cites.
Minimax bounds on stochastic batched convex optimization
John Duchi, Feng Ruan, and Chulhee Yun · 2018
Later among the works it cites.
Batched multi-armed bandits with optimal regret
Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, and Vahab Mirrokni · 2019
Closest in time.