The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Deterministic Boltzmann Learning Performs Steepest Descent in Weight-Space
Open accessAbstract
The Boltzmann machine learning procedure has been successfully applied in deterministic networks of analog units that use a mean field approximation to efficiently simulate a truly stochastic system (Peterson and Anderson 1987). This type of “deterministic Boltzmann machine” (DBM) learns much faster than the equivalent “stochastic Boltzmann machine” (SBM), but since the learning procedure for DBM's is only based on an analogy with SBM's, there is no existing proof that it performs gradient descent in any function, and it has only been justified by simulations. By using the appropriate interpretation for the way in which a DBM represents the probability of an output vector given an input vector, it is shown that the DBM performs steepest descent in the same function as the original SBM, except at rare discontinuities. A very simple way of forcing the weights to become symmetrical is also described, and this makes the DBM more biologically plausible than back-propagation (Werbos 1974; Parker 1985; Rumelhart et al. 1986).
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.
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Self-citationHopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Cited by
O'Reilly, R. C., & Frank, M. J. (2006) · Neural Computation · doi:10.1162/089976606775093909 · Cited by 1,066
Conjunctive representations in learning and memory: Principles of cortical and hippocampal function.
O'Reilly, R. C., & Rudy, J. W. (2001) · Psychological Review · doi:10.1037//0033-295x.108.2.311 · Cited by 865
Deep dyslexia: A case study of connectionist neuropsychology
Plaut, D. C., & Shallice, T. (1993) · Cognitive Neuropsychology · doi:10.1080/02643299308253469 · Cited by 856
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
Metadata
- Authors
- Hinton, G. E.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1989-03
- Volume
- 1
- Issue
- 1
- Pages
- 143-150
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2046913730
- Cited by
- 206
- References
- 2
- FWCI
- 11.59
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Deterministic Boltzmann Learning Performs Steepest Descent in Weight-Space. https://app.cochat.ai/papers/10.1162/neco.1989.1.1.143
- The paper
- Hinton, G. E. (1989). Deterministic Boltzmann Learning Performs Steepest Descent in Weight-Space. Neural Computation. https://doi.org/10.1162/neco.1989.1.1.143
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.