Cited by 9,083Reinforcement Learning in RoboticsMachine Learning and AlgorithmsAdaptive Dynamic Programming Control

Q-learning

Open access
Watkins, Christopher J. C. H., Dayan, Peter·1992·Machine Learning

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/bf00992698

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. Sato, M], Abe, K. & Takeda, H. (1988). Learning control of finite Markov chains with explicit trade-offbetween estimation and control. IEEE Transactions on Systems, Man and Cybernetics, 18, pp. 67%684.
  2. Sutton, R.S. (1988). Learning to predict by the methods of temporal difference. Machine Learning, 3, pp. 9-44.
  3. Werbos, EJ. (1977). Advanced forecasting methods for global crisis warning and models of intelligence. General Systems Yearbook, 22, pp. 25-38.

Cited by

Sorted by citations

Authors
Watkins, C. J. C. H., & Dayan, P.
Affiliations
University of Edinburgh (GB)
Venue
Machine Learning
Published
1992-05
Volume
8
Issue
3-4
Pages
279-292
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W32403112
Cited by
9,083
References
13
Citations by year
2026: 263 · 2025: 669 · 2024: 994 · 2023: 1083 · 2022: 908 · 2021: 884 · 2020: 769 · 2019: 560 · 2018: 401 · 2017: 273 · 2016: 195 · 2015: 164 · 2014: 173 · 2013: 162 · 2012: 164
FWCI
15.61
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Adaptive Dynamic Programming Control
Keywords
Q-learning, convergence theorems, action-value function, Markov decision process, reinforcement learning, optimal control

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