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
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.
Integrity signals
Registry
Cites
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.
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?
In the citing paper
“A variety of analytic approximations exist which ameliorate, but do not remove, this tradeoff”
From Deep Unsupervised Learning using Nonequilibrium Thermodynamics (2015) · cites this paper as Welling & Hinton, 2002
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 5×
“In Contrastive Divergence (CD) learning (Hinton, 2000), we replace the correlations computed in the sleep phase of BM learning with the correlations conditioned on one-step reconstructions of the data.”
BackgroundMethodInfluentialSelf-citationA learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Self-citation
Research works printed but not linked: 5
- G.E. Hinton and T.J. Sejnowski. Learning and relearning in Boltzmann machines, volume Volume 1: Foundations. MIT Press, 1986.
- 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.
- 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
- C. Peterson and J. Anderson. A mean field theory learning algorithm for neural networks. Complex Systems, 1:995–1019, 1987.
- 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
Deep Unsupervised Learning using Nonequilibrium Thermodynamics
Sohl-Dickstein, J., Weiss, E. A., Maheswaranathan, N., & Ganguli, S. (2015) · arXiv · doi:10.48550/arxiv.1503.03585 · Cited by 2,637
A Connection Between Score Matching and Denoising Autoencoders
Vincent, P. (2011) · Neural Computation · doi:10.1162/neco_a_00142 · Cited by 1,011
Learning multiple layers of representation
Hinton, G. E. (2007) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2007.09.004 · Cited by 1,011
Self-citationA Unified Probabilistic Framework for Name Disambiguation in Digital Library
Tang, J., Fong, A. C. M., Wang, B., & Zhang, J. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.13 · Cited by 262
Integrative data analysis of multi-platform cancer data with a multimodal deep learning approach
Liang, M., Li, Z., Chen, T., & Zeng, J. (2015) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2014.2377729 · Cited by 231
Metadata
- Authors
- Welling, M., & Hinton, G. E.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- 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.