The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Unsupervised Learning
Abstract
What use can the brain make of the massive flow of sensory information that occurs without any associated rewards or punishments? This question is reviewed in the light of connectionist models of unsupervised learning and some older ideas, namely the cognitive maps and working models of Tolman and Craik, and the idea that redundancy is important for understanding perception (Attneave 1954), the physiology of sensory pathways (Barlow 1959), and pattern recognition (Watanabe 1960). It is argued that (1) The redundancy of sensory messages provides the knowledge incorporated in the maps or models. (2) Some of this knowledge can be obtained by observations of mean, variance, and covariance of sensory messages, and perhaps also by a method called “minimum entropy coding.” (3) Such knowledge may be incorporated in a model of “what usually happens” with which incoming messages are automatically compared, enabling unexpected discrepancies to be immediately identified. (4) Knowledge of the sort incorporated into such a filter is a necessary prerequisite of ordinary learning, and a representation whose elements are independent makes it possible to form associations with logical functions of the elements, not just with the elements themselves.
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
Fukushima, K. (1980) · Biological Cybernetics · doi:10.1007/bf00344251 · Cited by 5,759
Toward a modern theory of adaptive networks: Expectation and prediction.
Sutton, R. S., & Barto, A. G. (1981) · Psychological Review · doi:10.1037/0033-295x.88.2.135 · Cited by 1,450
Research works printed but not linked: 19
- 10.1037/h0054663 · DOI
- 10.1016/0004-3702(84)90052-3 · DOI
- 10.1098/rspb.1981.0022 · DOI · Paper page
- 10.1162/neco.1989.1.3.412 · DOI
- Barto A.G., 1983, IEEE Transact. Systems, Man, Cybernet. SMC-13(5), 835
- 10.1007/BF00337414 · DOI
- 10.1007/BF00342633 · DOI · Paper page
- 10.1037/0033-295X.87.1.1 · DOI
- 10.1073/pnas.83.19.7508 · DOI · Paper page
- 10.1007/BF00319777 · DOI
- 10.1038/298266a0 · DOI · Paper page
- 10.1007/BF03380115 · DOI
- 10.1207/s15516709cog0901_5 · DOI
- 10.1098/rspb.1980.0051 · DOI
- 10.1098/rspb.1982.0038 · DOI
- Uttley A.M., 1970, J. Tkeoret. Biol., 27, 3147
- Uttley A.M., 1975, Tkeoret. Biol., 49, 355
- 10.1007/BF00288907 · DOI
- Watanabe S., 1960, I. B. M. I. Res. Dezt, 4, 208
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
An Information-Maximization Approach to Blind Separation and Blind Deconvolution
Bell, A. J., & Sejnowski, T. J. (1995) · Neural Computation · doi:10.1162/neco.1995.7.6.1129 · Cited by 8,986
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles
Noroozi, M., & Favaro, P. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_5 · Cited by 2,775
Metadata
- Authors
- Barlow, H. B.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1989-09
- Volume
- 1
- Issue
- 3
- Pages
- 295-311
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2912889105
- Cited by
- 1,650
- References
- 2
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.