Fetching the paper…
Reading the bibliography…
We consider the problem of identifying the best arm in stochastic Multi-Armed Bandits (MABs) using a fixed sampling budget.
On large deviations from the invariant measure
Gärtner, J. (1977) · 1977
Earlier work this paper cites.
Large deviations for a general class of random vectors
Ellis, R. S. (1984) · 1984
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Lai, T. L. and Robbins, H. (1985) · 1985
Earlier work this paper cites.
Topological Spaces: including a treatment of multi-valued functions, vector spaces, and convexity
Berge, C. (1997) · 1997
Earlier work this paper cites.
Convex optimization
Boyd, S., Boyd, S. P., and Vandenberghe, L. (2004) · 2004
Earlier work this paper cites.
A large deviations perspective on ordinal optimization
Glynn, P. and Juneja, S. (2004) · 2004
Earlier work this paper cites.
Large deviations techniques and applications
Dembo, A. and Zeitouni, O. (2009) · 2009
Earlier work this paper cites.
Best arm identification in multi-armed bandits
Audibert, J.-Y., Bubeck, S., and Munos, R. (2010) · 2010
Earlier work this paper cites.
A weak convergence approach to the theory of large deviations
Dupuis, P. and Ellis, R. S. (2011) · 2011
Earlier work this paper cites.
Best arm identification: A unified approach to fixed budget and fixed confidence
Gabillon, V., Ghavamzadeh, M., and Lazaric, A. (2012) · 2012
Earlier work this paper cites.
Multiple identifications in multi-armed bandits
Bubeck, S., Wang, T., and Viswanathan, N. (2013) · 2013
Earlier work this paper cites.
Almost optimal exploration in multi-armed bandits
Karnin, Z., Koren, T., and Somekh, O. (2013) · 2013
Cited alongside, same era.
Lipschitz bandits: Regret lower bound and optimal algorithms
Magureanu, S., Combes, R., and Proutiere, A. (2014) · 2014
Cited alongside, same era.
Tight (lower) bounds for the fixed budget best arm identification bandit problem
Carpentier, A. and Locatelli, A. (2016) · 2016
Cited alongside, same era.
Optimal best arm identification with fixed confidence
Garivier, A. and Kaufmann, E. (2016) · 2016
Cited alongside, same era.
On the complexity of best-arm identification in multi-armed bandit models
Kaufmann, E., Cappé, O., and Garivier, A. (2016) · 2016
Cited alongside, same era.
Simple bayesian algorithms for best arm identification
Russo, D. (2016) · 2016
Cited alongside, same era.
Explore first, exploit next: The true shape of regret in bandit problems
Garivier, A., Ménard, P., and Stoltz, G. (2019) · 2019
Later among the works it cites.
Policy choice and best arm identification: Asymptotic analysis of exploration sampling
Ariu, K., Kato, M., Komiyama, J., McAlinn, K., and Qin, C. (2021) · 2021
Later among the works it cites.
Fast pure exploration via frank-wolfe
Wang, P.-A., Tzeng, R.-C., and Proutiere, A. (2021) · 2021
Later among the works it cites.
Fixed-budget best-arm identification in structured bandits
Azizi, M., Kveton, B., and Ghavamzadeh, M. (2022) · 2022
Later among the works it cites.
On best-arm identification with a fixed budget in non-parametric multi-armed bandits
Barrier, A., Garivier, A., and Stoltz, G. (2022) · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Large deviations
Varadhan, S. S. (2016) · 2016
Cited alongside, same era.
Minimal exploration in structured stochastic bandits
Combes, R., Magureanu, S., and Proutiere, A. (2017) · 2017
Cited alongside, same era.
Mixture martingales revisited with applications to sequential tests and confidence intervals
Kaufmann, E. and Koolen, W. (2018) · 2018
Cited alongside, same era.
Analysis and approximation of rare events
Budhiraja, A. and Dupuis, P. (2019) · 2019
Cited alongside, same era.
Pure exploration with multiple correct answers
Degenne, R. and Koolen, W. M. (2019) · 2019
Cited alongside, same era.
Komiyama, J. (2022) · 2022
Later among the works it cites.
Minimax optimal algorithms for fixed-budget best arm identification
Komiyama, J., Tsuchiya, T., and Honda, J. (2022) · 2022
Later among the works it cites.
Open problem: Optimal best arm identification with fixed-budget
Qin, C. (2022) · 2022
Later among the works it cites.
Minimax optimal fixed-budget best arm identification in linear bandits
Yang, J. and Tan, V. (2022) · 2022
Later among the works it cites.
On the existence of a complexity in fixed budget bandit identification
Degenne, R. (2023) · 2023
Closest in time.
On uniformly optimal algorithms for best arm identification in two-armed bandits with fixed budget
Wang, P.-A., Ariu, K., and Proutiere, A. (2023) · 2023
Closest in time.