Cited by 1,037Neural Networks and ApplicationsBayesian Modeling and Causal InferenceMachine Learning and Algorithms

Learning and relearning in Boltzmann machines

Hinton, G. E., Sejnowski, T. J.·2001·Graphical Models

Abstract

This chapter contains sections titled: Relaxation Searches, Easy and Hard Learning, The Boltzmann Machine Learning Algorithm, An Example of Hard Learning, Achieving Reliable Computation with Unreliable Hardware, An Example of the Effects of Damage, Conclusion, Acknowledgments, Appendix: Derivation of the Learning Algorithm, References

Integrity signals

Registry

Crossref · 10.7551/mitpress/3349.003.0005

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Within machine learning, there is a long history of algorithmic techniques that use dream-like processes for learning.

    “Interestingly, within machine learning, there is actually a long history of algorithmic techniques that use dream-like processes for learning.3, 4, 5, 6”

    From The overfitted brain hypothesis (2021) · cites this paper as [4]

Cited by

Sorted by citations

Authors
Hinton, G. E., & Sejnowski, T. J.
Venue
Graphical Models
Publisher
The MIT Press
Published
2001-10-12
Pages
45-76
OpenAlex
W1547224907
Cited by
1,037
References
0
Citations by year
2026: 1 · 2025: 6 · 2024: 23 · 2023: 18 · 2022: 21 · 2021: 32 · 2020: 32 · 2019: 28 · 2018: 37 · 2017: 38 · 2016: 34 · 2015: 36 · 2014: 35 · 2013: 21 · 2012: 14
FWCI
56.39
Type
book chapter
Language
en
Open access
closed
Locations
The MIT Press eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
Boltzmann machine, learning algorithms, fault tolerance, reliable computation

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