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

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

A New Learning Algorithm for Mean Field Boltzmann Machines

Welling, Max, Hinton, Geoffrey E.·2002·Lecture Notes in Computer Science

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.1007/3-540-46084-5_57

Cites

3 of 3 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

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.

Citations

Cites

Show all 3 references

Research works printed but not linked: 5

  1. G.E. Hinton and T.J. Sejnowski. Learning and relearning in Boltzmann machines, volume Volume 1: Foundations. MIT Press, 1986.
  2. G.E. Hinton, M. Welling, Y.W. Teh, and K. Osindero. A new view of ICA. In Int. Conf. on Independent Component Analysis and Blind Source Separation, 2001.
  3. J.R. Movellan. Contrastive hebbian learning in the continuous hopfield model. In Connectionist Models, Proceedings of the 1990 Summer School, pages 10–17, 1991. · DOI
  4. C. Peterson and J. Anderson. A mean field theory learning algorithm for neural networks. Complex Systems, 1:995–1019, 1987.
  5. I. Stoianov, M. Zorzi, S. Becker, and C. Umilta. Associative arithmetic with Boltz-mann machines: the role of number representations. In International Conference on Artificial Neural Networks, 2002. · doi:10.1007/3-540-46084-5_46

Cited by

See all 47

Metadata

Authors
Welling, M., & Hinton, G. E.
Venue
Lecture Notes in Computer Science
Published
2002
Pages
351-357
ISSN
0302-9743
Cited by
47
References
3

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 Learning Algorithm for Mean Field Boltzmann Machines. https://app.cochat.ai/papers/10.1007/3-540-46084-5_57
The paper
Welling, M., & Hinton, G. E. (2002). A New Learning Algorithm for Mean Field Boltzmann Machines. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-46084-5_57

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.