Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 172

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Using Expectation-Maximization for Reinforcement Learning

Dayan, Peter, Hinton, Geoffrey E. · 1997 · Neural Computation

Abstract

We discuss Hinton's (1989) relative payoff procedure (RPP), a static reinforcement learning algorithm whose foundation is not stochastic gradient ascent. We show circumstances under which applying the RPP is guaranteed to increase the mean return, even though it can make large changes in the values of the parameters. The proof is based on a mapping between the RPP and a form of the expectation-maximization procedure of Dempster, Laird, and Rubin (1977).

Overview

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.1162/neco.1997.9.2.271

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 1 references

Cited by

See all 172

Metadata

Authors
Dayan, P., & Hinton, G. E.
Venue
Neural Computation
Published
1997-02-01
Volume
9
Issue
2
Pages
271-278
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2080039641
Cited by
172
References
1
FWCI
0.48
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Using Expectation-Maximization for Reinforcement Learning. https://app.cochat.ai/papers/10.1162/neco.1997.9.2.271
The paper
Dayan, P., & Hinton, G. E. (1997). Using Expectation-Maximization for Reinforcement Learning. Neural Computation. https://doi.org/10.1162/neco.1997.9.2.271

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.