The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Average reward reinforcement learning: Foundations, algorithms, and empirical results
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
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
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
Learning Automata: An Introduction
Narendra, K. S., & Thathachar, M. A. L. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,540
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
Sutton, R. S. (1990) · Machine Learning Proceedings 1990 · doi:10.1016/b978-1-55860-141-3.50030-4 · Cited by 1,314
Introduction to Stochastic Dynamic Programming.
Berry, D. A., & Ross, S. M. (1986) · Journal of the American Statistical Association · doi:10.2307/2289262 · Cited by 1,133
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
Residual Algorithms: Reinforcement Learning with Function Approximation
Baird, L. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50013-x · Cited by 918
Reinforcement learning for robots using neural networks
Lin, L.-J. (1992) · Defense Technical Information Center (DTIC) · Cited by 841
Practical issues in temporal difference learning
Tesauro, G. (1992) · Machine Learning · doi:10.1007/bf00992697 · Cited by 787
Kaelbling, L. P. (1993) · doi:10.7551/mitpress/4168.001.0001 · Cited by 599
Automatic programming of behavior-based robots using reinforcement learning
Mahadevan, S., & Connell, J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90058-6 · Cited by 591
Self-citationDayan, P., & Hinton, G. E. (1992) · Cited by 540
Asynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (1994) · Machine Learning · doi:10.1007/bf00993306 · Cited by 453
(1992) · Springer eBooks · doi:10.1007/978-1-4615-3618-5 · Cited by 331
A Reinforcement Learning Method for Maximizing Undiscounted Rewards
Schwartz, A. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50045-9 · Cited by 308
Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
Veinott, A. F. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697379 · Cited by 248
The role of exploration in learning control
Thrun, S. (1992) · Cited by 226
Distributed dynamic programming
Bertsekas, D. (1982) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1982.1102980 · Cited by 216
Engelberger, J. F. (1989) · Springer eBooks · doi:10.1007/978-94-009-1099-7 · Cited by 194
Hierarchical Learning in Stochastic Domains: Preliminary Results
Kaelbling, L. P. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50028-9 · Cited by 172
Moore, A. W. (1991) · Machine Learning Proceedings 1991 · doi:10.1016/b978-1-55860-200-7.50069-6 · Cited by 162
A personal learning apprentice
Dent, L., Boticario, J. G., McDermott, J. P., Mitchell, T. M., & Zabowski, D. (1992) · Cited by 156
Practical Issues in Temporal Difference Learning
Tesauro, G. J. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3618-5_3 · Cited by 122
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
Decentralized learning in finite Markov chains
Wheeler, R. M., & Narendra, K. S. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104342 · Cited by 98
Introduction to stochastic dynamic programming
Ross, S. M., Birnbaum, Z. W., & Lukacs, E. (1983) · Cited by 97
Learning Multiple Goal Behavior via Task Decomposition and Dynamic Policy Merging
Whitehead, S. D., Karlsson, J., & Tenenberg, J. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3184-5_3 · Cited by 96
Reinforcement learning algorithms for average-payoff markovian decision processes
Singh, S. P. (1994) · Cited by 79
Density-Adaptive Learning and Forgetting
Salganicoff, M. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50042-3 · Cited by 65
Learning to Solve Markovian Decision Processes
Singh, S. P. (1993) · Cited by 63
Mahadevan, S. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50028-3 · Cited by 37
Self-citationEnhancing Transfer in Reinforcement Learning by Building Stochastic Models of Robot Actions
Mahadevan, S. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50042-5 · Cited by 34
Self-citationProcess-oriented planning and average-reward optimality
Boutiller, C., & Puterman, M. L. (1995) · Cited by 20
H-Learning: A Reinforcement Learning Method for Optimizing Undiscounted Average Reward
Tadepalli, P. V., & Ok, D. (1994) · Cited by 13
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
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
Tonic dopamine: Opportunity costs and the control of response vigor
Niv, Y., Daw, N. D., Joel, D., & Dayan, P. (2007) · Psychopharmacology · doi:10.1007/s00213-006-0502-4 · Cited by 1,133
Opponent interactions between serotonin and dopamine
Daw, N. D., Kakade, S., & Dayan, P. (2002) · Neural Networks · doi:10.1016/s0893-6080(02)00052-7 · Cited by 844
Metalearning and neuromodulation
Doya, K. (2002) · Neural Networks · doi:10.1016/s0893-6080(02)00044-8 · Cited by 704
Metadata
- Authors
- Mahadevan, S.
- Venue
- Machine Learning
- Published
- 1996
- Volume
- 22
- Issue
- 1-3
- Pages
- 159-195
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2101915445
- Cited by
- 385
- References
- 39
- FWCI
- 7.21
- 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.