Cited by 8,972Reinforcement Learning in RoboticsAdvanced Bandit Algorithms ResearchMachine Learning and Algorithms

Reinforcement Learning: A Survey

Open access
Kaelbling, L. P., Littman, M. L., Moore, A. W.·1996·Journal of Artificial Intelligence Research

Abstract

This paper surveys the field of reinforcement learning from a computer-science perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning is the problem faced by an agent that learns behavior through trial-and-error interactions with a dynamic environment. The work described here has a resemblance to work in psychology, but differs considerably in the details and in the use of the word ``reinforcement.'' The paper discusses central issues of reinforcement learning, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state. It concludes with a survey of some implemented systems and an assessment of the practical utility of current methods for reinforcement learning.

Integrity signals

Registry

Crossref · 10.1613/jair.301

Cites

150 of 150 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Most existing deep fake detection methods are CNN-based classification baselines trained for deep fake detection.

    “Most of the existing methods are CNN-based classification baselines trained for deep fake detection [6, 11, 22, 25].”
  • In reinforcement learning, positive feedback from a certain action results in a positive reward; based on this positive reward, the parameters of the policy model are adjusted to increase the probability of selecting this action in the corresponding state; conversely, if it is negative feedback, the parameters of the model will be adjusted to decrease the probability of selecting this action. The

    “In reinforcement learning, positive feedback from a certain action results in a positive reward. Based on this positive reward, the parameters of the policy model are adjusted to increase the probability of selecting this action in the corresponding state. Conversely, if it is negative feedback, the parameters of the model will be adjusted to decrease the probability of selecting this action. The”

    From Human-inspired Perspectives: A Survey on AI Long-term Memory (2024) · cites this paper as [19]

  • The loop of 'primitive action - feedback - update procedural memory - improved action' described in the bicycle riding example is similar to reinforcement learning in AI.

    “The loop of 'primitive action - feedback - update procedural memory - improved action' described in the bicycle riding example is similar to reinforcement learning in AI [19, 21, 22].”

    From Human-inspired Perspectives: A Survey on AI Long-term Memory (2024) · cites this paper as [19]

Cites

Flagged first, then by citations

12 of the 162 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Kaelbling, L. P., Littman, M. L., & Moore, A. W.
Affiliations
  • Brown University (US)
  • Carnegie Mellon University (US)
Venue
Journal of Artificial Intelligence Research
Published
1996-05-01
Volume
4
Pages
237-285
ISSN
1076-9757 (ISSN-L)
OpenAlex
W2107726111
Cited by
8,972
References
162
Citations by year
2026: 367 · 2025: 703 · 2024: 626 · 2023: 597 · 2022: 498 · 2021: 549 · 2020: 583 · 2019: 416 · 2018: 351 · 2017: 266 · 2016: 201 · 2015: 218 · 2014: 233 · 2013: 272 · 2012: 225
FWCI
94.14
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Journal of Artificial Intelligence Research (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (9453383, 9312395)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
reinforcement learning, Markov decision theory, exploration-exploitation balance, delayed reinforcement, empirical model, generalization, hierarchical learning, hidden states, learning from interaction, agent-environment interaction

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