The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Adaptive ε-Greedy Exploration in Reinforcement Learning Based on Value Differences
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
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
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
On-line Q-learning Using Connectionist Systems
Rummery, G. A. (1994) · Cited by 1,477
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
Multi-armed Bandit Algorithms and Empirical Evaluation
Vermorel, J., & Mohri, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564096_42 · Cited by 513
Peters, J., Vijayakumar, S., & Schaal, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564096_29 · Cited by 307
Efficient Exploration in Reinforcement Learning
(2012) · SpringerReference · doi:10.1007/springerreference_178956 · Cited by 257
Cited by
Exploration in deep reinforcement learning: A survey
Ladosz, P., Weng, L., Kim, M., & Oh, H. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.03.003 · Cited by 525
Li, L., Wu, D., Huang, Y., & Yuan, Z.-M. (2021) · Applied Ocean Research · doi:10.1016/j.apor.2021.102759 · Cited by 323
Order-free Medicine Combination Prediction with Graph Convolutional Reinforcement Learning
Wang, S., Ren, P., Chen, Z., Ren, Z., Ma, J., & de Rijke, M. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357965 · Cited by 76
A Survey of Exploration Methods in Reinforcement Learning
Amin, S., Gomrokchi, M., Satija, H., van Hoof, H., & Precup, D. (2021) · arXiv · doi:10.48550/arxiv.2109.00157 · Cited by 41
MDLdroid: a ChainSGD-reduce Approach to Mobile Deep Learning for Personal Mobile Sensing
Zhang, Y., Gu, T., & Zhang, X. (2020) · 2020 19th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn48710.2020.00-45 · Cited by 23
Metadata
- Authors
- Tokic, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 203-210
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2167489871
- Cited by
- 261
- References
- 14
- FWCI
- 3.38
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive ε-Greedy Exploration in Reinforcement Learning Based on Value Differences. https://app.cochat.ai/papers/10.1007/978-3-642-16111-7_23
- The paper
- Tokic, M. (2010). Adaptive ε-Greedy Exploration in Reinforcement Learning Based on Value Differences. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-16111-7_23
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.