The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Near-Optimal Reinforcement Learning in Polynomial Time
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
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
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1023/a:1022676722315 · Cited by 3,907
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Baxter, L. A. (1995) · Technometrics · doi:10.1080/00401706.1995.10484354 · Cited by 2,415
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
On-line Q-learning Using Connectionist Systems
Rummery, G. A. (1994) · Cited by 1,477
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
Generalization in Reinforcement Learning: Successful Examples Using Sparse Coarse Coding
Sutton, R. S. (1995) · Cited by 1,072
Stochastic systems : estimation, identification, and adaptive control
Kumar, P. R., & Varaiya, P. (1986) · Medical Entomology and Zoology · Cited by 1,018
Prioritized sweeping: Reinforcement learning with less data and less time
Moore, A. W., & Atkeson, C. G. (1993) · Machine Learning · doi:10.1007/bf00993104 · Cited by 823
On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
Jaakkola, T., Jordan, M. I., & Singh, S. P. (1994) · Neural Computation · doi:10.1162/neco.1994.6.6.1185 · Cited by 770
Self-citationHandbook of Intelligent Control: Neural, Fuzzy, and Adaptive Approaches
White, D. A., & Sofge, D. (1992) · Medical Entomology and Zoology · Cited by 705
Learning policies for partially observable environments: Scaling up
Littman, M. L., Cassandra, A. R., & Kaelbling, L. P. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50052-9 · Cited by 650
Convergence Results for Single-Step On-Policy Reinforcement-Learning Algorithms
Singh, S., Jaakkola, T., Littman, M. L., & Szepesvári, C. (2000) · Machine Learning · doi:10.1023/a:1007678930559 · Cited by 609
Self-citationReinforcement learning with replacing eligibility traces
Singh, S. P., & Sutton, R. S. (1996) · Machine Learning · doi:10.1007/bf00114726 · Cited by 575
Self-citationAsynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (1994) · Machine Learning · doi:10.1007/bf00993306 · Cited by 453
Stable Function Approximation in Dynamic Programming
Gordon, G. J. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50040-2 · Cited by 446
Feature-based methods for large scale dynamic programming
Tsitsiklis, J. N., & van Roy, B. (1996) · Machine Learning · doi:10.1007/bf00114724 · Cited by 432
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sinclair, A. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0323-0 · Cited by 380
Reinforcement Learning Algorithm for Partially Observable Markov Decision Problems
Jaakkola, T., Singh, S. P., & Jordan, M. I. (1994) · Cited by 361
Self-citationReinforcement learning with perceptual aliasing: the perceptual distinctions approach
Chrisman, L. (1992) · Cited by 313
Reinforcement Learning with Soft State Aggregation
Singh, S. P., Jaakkola, T., & Jordan, M. I. (1994) · Cited by 274
Self-citationThe role of exploration in learning control
Thrun, S. (1992) · Cited by 258
On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
Jaakkola, T., Jordan, M. I., & Singh, S. P. (1993) · Defense Technical Information Center (DTIC) · doi:10.21236/ada276517 · Cited by 165
Self-citationEfficient reinforcement learning in factored MDPs
Kearns, M. J., & Koller, D. (1999) · Cited by 142
Self-citationAsynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1993.325119 · Cited by 116
Efficient reinforcement learning
Fiechter, C.-N. (1994) · Conference on Learning Theory · doi:10.1145/180139.181019 · Cited by 110
Feature-Based Methods for Large Scale Dynamic Programming
Tsitsiklis, J. N., & Roy, B. V. (1996) · Springer eBooks · doi:10.1007/978-0-585-33656-5_5 · Cited by 90
Reinforcement Learning with Replacing Eligibility Traces
Singh, S. P., & Sutton, R. S. (2007) · Springer eBooks · doi:10.1007/978-0-585-33656-5_7 · Cited by 66
Self-citationSequential Decision Problems and Neural Networks
Barto, A. G., Sutton, R. S., & Watkins, C. (1989) · neural information processing systems · Cited by 60
Feature-based methods for large scale dynamic programming
Tsitsiklis, J. N., & Roy, B. V. (2002) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.1995.478954 · Cited by 38
Expected Mistake Bound Model for On-Line Reinforcement Learning
Fiechter, C.-N. (1997) · Cited by 22
Cited by
Reinforcement learning in robotics: A survey
Kober, J., Bagnell, J. A., & Peters, J. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913495721 · Cited by 3,160
Transfer Learning for Reinforcement Learning Domains: A Survey
Taylor, M. E., & Stone, P. (2009) · doi:10.5555/1577069.1755839 · Cited by 1,488
(2015) · Journal of Machine Learning Research · Cited by 1,119
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
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Metadata
- Authors
- Kearns, M., & Singh, S.
- Venue
- Machine Learning
- Published
- 2002-11
- Volume
- 49
- Issue
- 2-3
- Pages
- 209-232
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2489939061
- Cited by
- 792
- References
- 42
- FWCI
- 12.38
- 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.