Fetching the paper…
Reading the bibliography…
In this paper, we study a best arm identification problem with dual objects.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
Williams 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 multiple-decision procedure for selecting the best one of several normal populations with a common unknown variance, and its use with various experimental designs
Robert E. Bechhofer · 1958
Earlier work this paper cites.
Sequential Design of Experiments
Herman Chernoff · 1959
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
T.L Lai and Herbert Robbins · 1985
Earlier work this paper cites.
Adaptive Treatment Allocation and the Multi-Armed Bandit Problem
Tze Leung Lai · 1987
Earlier work this paper cites.
Optimal adaptive policies for sequential allocation problems
Apostolos N. Burnetas and Michael N. Katehakis · 1996
Earlier work this paper cites.
Bridging the gap between regret minimization and best arm identification, with application to a/b tests
Rémy Degenne, Thomas Nedelec, Clement Calauzenes, and Vianney Perchet · 1996
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer · 2002
Earlier work this paper cites.
Active learning in multi-armed bandits
András Antos, Varun Grover, and Csaba Szepesvári · 2008
Earlier work this paper cites.
Best Arm Identification in Multi-Armed Bandits
Jean-Yves Audibert and Sébastien Bubeck · 2010
Earlier work this paper cites.
The kl-ucb algorithm for bounded stochastic bandits and beyond
Aurélien Garivier and Olivier Cappé · 2011
Earlier work this paper cites.
Best arm identification: A unified approach to fixed budget and fixed confidence
Victor Gabillon, Mohammad Ghavamzadeh, and Alessandro Lazaric · 2012
Earlier work this paper cites.
Pac subset selection in stochastic multi-armed bandits
Shivaram Kalyanakrishnan, Ambuj Tewari, Peter Auer, and Peter Stone · 2012
Earlier work this paper cites.
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Earlier work this paper cites.
Kullback–leibler upper confidence bounds for optimal sequential allocation
Olivier Cappé , Aurélien Garivier, Odalric-Ambrym Maillard, Rémi Munos, and Gilles Stoltz · 2013
Cited alongside, same era.
Multi-armed bandit with budget constraint and variable costs
Wenkui Ding, Tao Qin, Xu-Dong Zhang, and Tie-Yan Liu · 2013
Cited alongside, same era.
Information complexity in bandit subset selection
Emilie Kaufmann and Shivaram Kalyanakrishnan · 2013
Cited alongside, same era.
A fast bandit algorithm for recommendation to users with heterogenous tastes
Pushmeet Kohli, Mahyar Salek, and Greg Stoddard · 2013
Cited alongside, same era.
Lipschitz bandits: Regret lower bound and optimal algorithms
Stefan Magureanu, Richard Combes, and Alexandre Proutiere · 2014
Cited alongside, same era.
Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Later among the works it cites.
Pond: Pessimistic-optimistic online dispatching
Xin Liu, Bin Li, Pengyi Shi, and Lei Ying · 2020
Later among the works it cites.
Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models
Aurélien Garivier and Emilie Kaufmann · 2021
Later among the works it cites.
The role of contextual information in best arm identification
Masahiro Kato and Kaito Ariu · 2021
Later among the works it cites.
Mixture martingales revisited with applications to sequential tests and confidence intervals
Emilie Kaufmann and Wouter M. Koolen · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sofía S Villar, Jack Bowden, and James Wason · 2015
Cited alongside, same era.
Tight (lower) bounds for the fixed budget best arm identification bandit problem
Alexandra Carpentier and Andrea Locatelli · 2016
Cited alongside, same era.
Optimal best arm identification with fixed confidence
Aurélien Garivier and Emilie Kaufmann · 2016
Cited alongside, same era.
The multi-fidelity multi-armed bandit
Kirthevasan Kandasamy, Gautam Dasarathy, Barnabas Poczos, and Jeff Schneider · 2016
Cited alongside, same era.
On the complexity of best-arm identification in multi-armed bandit models
Emilie Kaufmann, Olivier Cappé, and Aurélien Garivier · 2016
Cited alongside, same era.
Budgeted bandit problems with continuous random costs
Yingce Xia, Wenkui Ding, Xu-Dong Zhang, Nenghai Yu, and Tao Qin · 2016
Cited alongside, same era.
Explore first, exploit next: The true shape of regret in bandit problems
Aurélien Garivier, Pierre Ménard, and Gilles Stoltz · 2017
Cited alongside, same era.
Multi-armed bandits with cost subsidy
Deeksha Sinha, Karthik Abinav Sankararaman, Abbas Kazerouni, and Vashist Avadhanula · 2021
Later among the works it cites.
A cost–based analysis for risk–averse explore–then–commit finite–time bandits
Ali Yekkehkhany, Ebrahim Arian, Rakesh Nagi, and Ilan Shomorony · 2021
Later among the works it cites.
A non-asymptotic approach to best-arm identification for gaussian bandits
Antoine Barrier, Aurélien Garivier, and Tomáš Kocák · 2022
Later among the works it cites.
Almost optimal variance-constrained best arm identification
Yunlong Hou, Vincent Y. F. Tan, and Zixin Zhong · 2022
Later among the works it cites.
Multi-fidelity best-arm identification
Riccardo Poiani, Alberto Maria Metelli, and Marcello Restelli · 2022
Later among the works it cites.
Best arm identification with safety constraints
Zhenlin Wang, Andrew J. Wagenmaker, and Kevin Jamieson · 2022
Later among the works it cites.
Dealing with unknown variances in best-arm identification
Marc Jourdan, Degenne Rémy, and Kaufmann Emilie · 2023
Later among the works it cites.
Multi-fidelity multi-armed bandits revisited
Xuchuang Wang, Qingyun Wu, Wei Chen, and John C.S. Lui · 2023
Later among the works it cites.
Fast and regret optimal best arm identification: Fundamental limits and low-complexity algorithms
Qining Zhang and Lei Ying · 2023
Later among the works it cites.