The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Multi-armed Bandit Algorithms and Empirical Evaluation
Overview
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
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
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
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Pfanzagl, J., & Luce, R. D. (1962) · Econometrica · doi:10.2307/1911299 · Cited by 2,469
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
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
Sutton, R. S. (1990) · Machine Learning Proceedings 1990 · doi:10.1016/b978-1-55860-141-3.50030-4 · Cited by 1,314
Editorial: On Machine Learning
Langley, P. (1986) · Machine Learning · doi:10.1023/a:1022687019898 · Cited by 951
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492488 · Cited by 742
Kaelbling, L. P. (1993) · doi:10.7551/mitpress/4168.001.0001 · Cited by 599
Computing Science and Statistics
(1992) · Springer eBooks · doi:10.1007/978-1-4612-2856-1 · Cited by 449
A Bayesian Framework for Reinforcement Learning
Strens, M. J. A. (2000) · International Conference on Machine Learning · Cited by 358
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Mannor, S., & Tsitsiklis, J. N. (2004) · doi:10.5555/1005332.1005355 · Cited by 307
On the use and performance of content distribution networks
Krishnamurthy, B., Wills, C., & Zhang, Y. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505224 · Cited by 305
PAC Bounds for Multi-armed Bandit and Markov Decision Processes
Even-Dar, E., Mannor, S., & Mansour, Y. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45435-7_18 · Cited by 298
The weighted majority algorithm
Littlestone, N., & Warmuth, M. K. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63487 · Cited by 295
Extensions of the multiarmed bandit problem: The discounted case
Varaiya, P., Walrand, J., & Buyukkoc, C. (1985) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1985.1103989 · Cited by 279
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
Awerbuch, B., & Kleinberg, R. D. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007367 · Cited by 190
Proceedings of the seventh international conference (1990) on Machine learning
Morgan, M. B. (1990) · Cited by 142
Four proofs of Gittins’ multiarmed bandit theorem
Frostig, E., & Weiss, G. (2014) · Annals of Operations Research · doi:10.1007/s10479-013-1523-0 · Cited by 126
Exploration of Multi-State Environments: Local Measures and Back-Propagation of Uncertainty
Meuleau, N., & Bourgine, P. (1999) · Machine Learning · doi:10.1023/a:1007541107674 · Cited by 91
Exploration and Inference in Learning from Reinforcement
Wyatt, J. (1998) · ERA · Cited by 75
Finite-Time Regret Bounds for the Multiarmed Bandit Problem
Cesa‐Bianchi, N., & Fischer, P. (1998) · Cited by 61
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
Mannor, S., & Tsitsiklis, J. N. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_31 · Cited by 23
Cited by
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
The use of machine learning algorithms in recommender systems: a systematic review
Portugal, I., Alencar, P., & Cowan, D. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.12.020 · Cited by 743
“Bandit algorithms are used to decide how many times and in which order decisions are made to maximize a given value [65].”
MethodEnhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters
Dou, Y., Liu, Z., Sun, L., Deng, Y., Peng, H., & Yu, P. S. (2020) · Proceedings of the 29th ACM International Conference on Information & Knowledge Management · doi:10.1145/3340531.3411903 · Cited by 612
Dynamic pricing and learning: Historical origins, current research, and new directions
den Boer, A. V. (2015) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2015.03.001 · Cited by 427
Quantum Reinforcement Learning
Dong, D., Chen, C., Li, H., & Tarn, T.-J. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.925743 · Cited by 410
Metadata
- Authors
- Vermorel, J., & Mohri, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 437-448
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1516061453
- Cited by
- 513
- References
- 24
- FWCI
- 11.67
- Type
- conference paper
- Language
- en
- Open access
- closed
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.