The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Convergence Results for Single-Step On-Policy Reinforcement-Learning Algorithms
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
(1995) · Cited by 10,558
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Self-citationMarkov 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
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Baxter, L. A. (1995) · Technometrics · doi:10.1080/00401706.1995.10484354 · Cited by 2,415
Temporal difference learning and TD-Gammon
Tesauro, G. (1995) · Communications of the ACM · doi:10.1145/203330.203343 · Cited by 1,618 · cited 1×
“…that the approach of using a greedy learning policy has yielded some impressive successes, including the world's finest backgammon-playing program (Tesauro, 1995), and state-of-the-art systems for space shuttle scheduling (Zhang & Dietterich, 1995), elevator control (Crites & Barto, 1996), and…”
BackgroundOn-line Q-learning Using Connectionist Systems
Rummery, G. A. (1994) · Cited by 1,477
An analysis of temporal-difference learning with function approximation
Tsitsiklis, J. N., & Van Roy, B. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.580874 · Cited by 1,194
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Self-citationGeneralization 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
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-citationTemporal Difference Learning and TD-Gammon
Tesauro, G. (1995) · ICGA Journal · doi:10.3233/icg-1995-18207 · Cited by 764
Handbook of Intelligent Control: Neural, Fuzzy, and Adaptive Approaches
White, D. A., & Sofge, D. (1992) · Medical Entomology and Zoology · Cited by 705
Reinforcement learning with replacing eligibility traces
Singh, S. P., & Sutton, R. S. (1996) · Machine Learning · doi:10.1007/bf00114726 · Cited by 575
Self-citationGeneralization in Reinforcement Learning: Safely Approximating the Value Function
Boyan, J. A., & Moore, A. (1994) · Cited by 508
Improving Elevator Performance Using Reinforcement Learning
Crites, R. H., & Barto, A. G. (1995) · Cited by 499
Asynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (1994) · Machine Learning · doi:10.1007/bf00993306 · Cited by 453
Breiman, L. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971286 · Cited by 373
Algorithms for Sequential Decision Making
Littman, M. L. (1996) · Cited by 341
Self-citationThe convergence of TD(?) for general ?
Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992701 · Cited by 275
The role of exploration in learning control
Thrun, S. (1992) · Cited by 258
A Generalized Reinforcement-Learning Model: Convergence and Applications
Littman, M. L., & ''ri, C. S. (1996) · International Conference on Machine Learning · Cited by 217
Self-citationReinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
Singh, S. P., & Bertsekas, D. P. (1996) · Cited by 214
Self-citationTD(λ) Converges with Probability 1
Dayan, P., & Sejnowski, T. J. (1994) · Machine Learning · doi:10.1023/a:1022657612745 · Cited by 169
Asynchronous Stochastic Approximations
Borkar, V. S. (1998) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012995282784 · Cited by 167
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-citationAn Upper Bound on the Loss from Approximate Optimal-Value Functions
Singh, S. P., & Yee, R. C. (1994) · Machine Learning · doi:10.1007/bf00993308 · Cited by 135
Self-citationExploration Bonuses and Dual Control
Dayan, P., & B, T. J. S. A. (1996) · Machine Learning · doi:10.1023/a:1018357105171 · Cited by 120
Asynchronous 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
High-Performance Job-Shop Scheduling With A Time-Delay TD(λ) Network
Zhang, W., & Dietterich, T. G. (1995) · neural information processing systems · Cited by 97
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/2026.003.0005 · Cited by 92
Self-citationGeneralized Markov Decision Processes: Dynamic-programming and Reinforcement-learning Algorithms
Ari, C. S., & Littman, M. L. (1996) · Cited by 70
Self-citationReinforcement 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-citationThe convergence of convergence
Withey, R. (2001) · Aslib Journal of Information Management · doi:10.1108/eum0000000007046 · Cited by 12
Cited by
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132
Addressing Function Approximation Error in Actor-Critic Methods
Fujimoto, S., van Hoof, H., & Meger, D. (2018) · arXiv · doi:10.48550/arxiv.1802.09477 · Cited by 3,650
Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition
Dietterich, T. G. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.639 · Cited by 1,435
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
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-citation
Metadata
- Authors
- Singh, S., Jaakkola, T., Littman, M. L., & Szepesvári, C.
- Venue
- Machine Learning
- Published
- 2000-03
- Volume
- 38
- Issue
- 3
- Pages
- 287-308
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2150339816
- Cited by
- 609
- References
- 42
- FWCI
- 17.08
- 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.