The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Unsupervised learning by competing hidden units
Open accessAbstract
It is widely believed that end-to-end training with the backpropagation algorithm is essential for learning good feature detectors in early layers of artificial neural networks, so that these detectors are useful for the task performed by the higher layers of that neural network. At the same time, the traditional form of backpropagation is biologically implausible. In the present paper we propose an unusual learning rule, which has a degree of biological plausibility and which is motivated by Hebb’s idea that change of the synapse strength should be local—i.e., should depend only on the activities of the pre- and postsynaptic neurons. We design a learning algorithm that utilizes global inhibition in the hidden layer and is capable of learning early feature detectors in a completely unsupervised way. These learned lower-layer feature detectors can be used to train higher-layer weights in a usual supervised way so that the performance of the full network is comparable to the performance of standard feedforward networks trained end-to-end with a backpropagation algorithm on simple tasks.
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.
Integrity signals
Registry
Cites
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.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Bienenstock, E., Cooper, L., & Munro, P. (1982) · The Journal of Neuroscience · doi:10.1523/jneurosci.02-01-00032.1982 · Cited by 2,896 · cited 2×
“A biologically plausible mechanism for development of direction selectivity in the visual cortex was suggested by Bienenstock, Cooper, and Munro [17].”
MethodA massively parallel architecture for a self-organizing neural pattern recognition machine
Carpenter, G. A., & Grossberg, S. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80014-2 · Cited by 2,525
Simplified neuron model as a principal component analyzer
Oja, E. (1982) · Journal of Mathematical Biology · doi:10.1007/bf00275687 · Cited by 2,309 · cited 1×
“Lastly, if one works on the ordinary Euclidean sphere with p = 2 and the function g ( Q ) = Q is linear, our learning rule reduces to the famous Oja rule [18].”
BackgroundNeuronal Dynamics: From Single Neurons to Networks and Models of Cognition
Gerstner, W., Kistler, W. M., Naud, R., & Paninski, L. (2014) · doi:10.1017/cbo9781107447615 · Cited by 1,515
Whittington, J. C. R., & Bogacz, R. (2017) · Neural Computation · doi:10.1162/neco_a_00949 · Cited by 278
Dense Associative Memory Is Robust to Adversarial Inputs
Krotov, D., & Hopfield, J. (2018) · Neural Computation · doi:10.1162/neco_a_01143 · Cited by 106
Self-citation
Cited by
On Interpretability of Artificial Neural Networks: A Survey
Fan, F.-L., Xiong, J., Li, M., & Wang, G. (2021) · IEEE Transactions on Radiation and Plasma Medical Sciences · doi:10.1109/trpms.2021.3066428 · Cited by 561
Theories of Error Back-Propagation in the Brain
Whittington, J. C. R., & Bogacz, R. (2019) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2018.12.005 · Cited by 420
An Unsupervised Machine Learning Algorithms: Comprehensive Review
Naeem, S., Ali, A., Anam, S., & Ahmed, M. M. (2023) · International Journal of Computing and Digital Systems · doi:10.12785/ijcds/130172 · Cited by 289
Chaki, J., Thillai Ganesh, S., Cidham, S. K., & Ananda Theertan, S. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2020.06.013 · Cited by 270
Onciul, R., Tataru, C.-I., Dumitru, A. V., Crivoi, C., Serban, M., Covache-Busuioc, R.-A., Radoi, M. P., & Toader, C. (2025) · Journal of Clinical Medicine · doi:10.3390/jcm14020550 · Cited by 113
“This principle of strengthening connections through repeated co-activation became a cornerstone of learning algorithms, influencing everything from unsupervised learning models to contemporary neural networks [124,125].”
Metadata
- Authors
- Krotov, D., & Hopfield, J. J.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2019-03-29
- Volume
- 116
- Issue
- 16
- Pages
- 7723-7731
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2810701348
- Cited by
- 162
- References
- 7
- FWCI
- 9.90
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Unsupervised learning by competing hidden units. https://app.cochat.ai/papers/10.1073/pnas.1820458116
- The paper
- Krotov, D., & Hopfield, J. J. (2019). Unsupervised learning by competing hidden units. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1820458116
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.