Preprint
Reinforcement Learning
Featured

Reinforcement Learning: A Survey

Leslie Pack Kaelbling(Brown University), Michael L. Littman(Brown University), Andrew Moore(Carnegie Mellon University)
May 1, 1996Journal of Artificial Intelligence Research9,947 citations

9.9k

Citations

424

Influential Citations

Journal of Artificial Intelligence Research

Venue

1996

Year

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.

Analysis

Why This Paper Matters

This 1996 survey by Kaelbling, Littman, and Moore is a landmark in reinforcement learning literature. At a time when RL was still a niche area within machine learning, the paper provided a comprehensive, accessible overview that helped define the field for a generation of researchers. Its clear articulation of the exploration-exploitation dilemma, the role of Markov decision processes, and the challenge of delayed reinforcement established a common vocabulary and conceptual framework.

The paper's significance lies in its synthesis of ideas from computer science, operations research, and psychology, while clearly distinguishing the RL approach from its psychological roots. By framing RL as a computational problem of learning from interaction, it set the stage for the algorithmic advances that followed, including the development of Q-learning and temporal-difference methods.

Technical Contributions

The paper makes several key technical contributions through its survey structure:

  • Markov Decision Theory Foundation: Formalizes RL problems as MDPs, providing a rigorous mathematical basis for value functions, Bellman equations, and dynamic programming.
  • Exploration vs. Exploitation: Discusses strategies like epsilon-greedy, softmax, and optimism in the face of uncertainty.
  • Delayed Reinforcement: Explains temporal-difference learning and Monte Carlo methods for credit assignment over time.
  • Model-Based vs. Model-Free: Contrasts approaches that learn a model of the environment (e.g., Dyna) with those that learn value functions directly (e.g., Q-learning).
  • Generalization and Hierarchy: Addresses function approximation and hierarchical RL, anticipating later work on deep RL and options.
  • Hidden State: Discusses partially observable MDPs (POMDPs) and methods like recurrent neural networks and memory-based approaches.

Results

As a survey, the paper does not present new experimental results. Instead, it catalogs existing empirical work, including:

  • Implemented systems such as TD-Gammon (Tesauro, 1995) which achieved expert-level play in backgammon using temporal-difference learning.
  • Applications in robotics, control, and game playing.
  • Comparisons of different algorithms on small-scale problems (e.g., grid worlds, maze navigation).

The paper's value is in its qualitative assessment of the state of the art, noting that while RL methods showed promise, practical utility was limited by issues of scalability, sample efficiency, and handling of large state spaces.

Significance

The broader impact of this survey is immense. With nearly 10,000 citations, it is one of the most influential papers in AI. It educated a generation of researchers and practitioners, providing the conceptual tools that later enabled breakthroughs such as deep Q-networks (DQN), AlphaGo, and modern robotics RL. The paper's taxonomy of challenges—exploration, delayed reward, generalization, hidden state—remains relevant today. While the field has advanced dramatically since 1996, this survey's clear exposition of fundamental principles ensures its continued value as a teaching resource and reference.