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

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

A New Q-Learning Algorithm Based on the Metropolis Criterion

Guo, M., Liu, Y., Malec, J. · 2004 · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)

Abstract

The balance between exploration and exploitation is one of the key problems of action selection in Q-learning. Pure exploitation causes the agent to reach the locally optimal policies quickly, whereas excessive exploration degrades the performance of the Q-learning algorithm even if it may accelerate the learning process and allow avoiding the locally optimal policies. In this paper, finding the optimum policy in Q-learning is described as search for the optimum solution in combinatorial optimization. The Metropolis criterion of simulated annealing algorithm is introduced in order to balance exploration and exploitation of Q-learning, and the modified Q-learning algorithm based on this criterion, SA-Q-learning, is presented. Experiments show that SA-Q-learning converges more quickly than Q-learning or Boltzmann exploration, and that the search does not suffer of performance degradation due to excessive exploration.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/tsmcb.2004.832154

Cites

5 of 5 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 5 references

Cited by

See all 176

Metadata

Authors
Guo, M., Liu, Y., & Malec, J.
Venue
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
Published
2004-10
Volume
34
Issue
5
Pages
2140-2143
ISSN
1083-4419 (ISSN-L)
OpenAlex
W2106155860
Cited by
176
References
5
FWCI
4.07
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: A New Q-Learning Algorithm Based on the Metropolis Criterion. https://app.cochat.ai/papers/10.1109/tsmcb.2004.832154
The paper
Guo, M., Liu, Y., & Malec, J. (2004). A New Q-Learning Algorithm Based on the Metropolis Criterion. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2004.832154

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.