The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Bandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855
Self-citationTHOMPSON, W. R. (1933) · Biometrika · doi:10.1093/biomet/25.3-4.285 · Cited by 2,712
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
Multi-Armed Bandit Allocation Indices.
Bather, J. A., & Gittins, J. C. (1990) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982809 · Cited by 998
On Tail Probabilities for Martingales
Freedman, D. A. (1975) · The Annals of Probability · doi:10.1214/aop/1176996452 · Cited by 618
Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
Agrawal, R. (1995) · Advances in Applied Probability · doi:10.2307/1427934 · Cited by 540
Cited by
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Algorithms for Reinforcement Learning
Szepesvári, C. (2010) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01551-9 · Cited by 1,049
Self-citationLattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Self-citationOptimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Online learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
Kaufmann, E., Cappé, O., & Garivier, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1407.4443 · Cited by 661
Intrinsic motivation, curiosity, and learning
Oudeyer, P.-Y., Gottlieb, J., & Lopes, M. (2016) · Progress in Brain Research · doi:10.1016/bs.pbr.2016.05.005 · Cited by 387
Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
Kaufmann, E., Korda, N., & Munos, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-34106-9_18 · Cited by 365
Self-citationThe KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
Garivier, A., & Cappé, O. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.2490 · Cited by 326
Kaptein, M., Markopoulos, P., de Ruyter, B., & Aarts, E. (2015) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2015.01.004 · Cited by 314
Collaborative Filtering Bandits
Li, S., Karatzoglou, A., & Gentile, C. (2016) · Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval · doi:10.1145/2911451.2911548 · Cited by 287
Hawkeye: Towards a Desired Directed Grey-box Fuzzer
Chen, H., Xue, Y., Li, Y., Chen, B., Xie, X., Wu, X., & Liu, Y. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243849 · Cited by 263
Time-uniform, nonparametric, nonasymptotic confidence sequences
Howard, S. R., Ramdas, A., McAuliffe, J., & Sekhon, J. (2021) · The Annals of Statistics · doi:10.1214/20-aos1991 · Cited by 190
Dynamic Online Pricing with Incomplete Information Using Multiarmed Bandit Experiments
Misra, K., Schwartz, E. M., & Abernethy, J. (2019) · Marketing Science · doi:10.1287/mksc.2018.1129 · Cited by 183
Automatic ad format selection via contextual bandits
Tang, L., Rosales, R., Singh, A., & Agarwal, D. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2514700 · Cited by 111
Efficient PAC Reinforcement Learning in Regular Decision Processes
Ronca, A., & De Giacomo, G. (2021) · Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/279 · Cited by 6
Recursive self-improvement of AI research agents
Srikanth, D., Zhao, B., Xu, D., Wu, Y., & Jiang, Z. (2026) · arXiv · doi:10.48550/arxiv.2609.26457
Dual Control for Approximate Bayesian Reinforcement Learning
Klenske, E. D., & Hennig, P. (2015) · arXiv
Metadata
- Authors
- Audibert, J.-Y., Munos, R., & Szepesvári, C.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2009-04
- Volume
- 410
- Issue
- 19
- Pages
- 1876-1902
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2142971854
- Cited by
- 569
- References
- 14
- FWCI
- 23.90
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.