The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Local Synaptic Learning Rules Suffice to Maximize Mutual Information in a Linear Network
Abstract
A network that develops to maximize the mutual information between its output and the signal portion of its input (which is admixed with noise) is useful for extracting salient input features, and may provide a model for aspects of biological neural network function. I describe a local synaptic Learning rule that performs stochastic gradient ascent in this information-theoretic quantity, for the case in which the input-output mapping is linear and the input signal and noise are multivariate gaussian. Feedforward connection strengths are modified by a Hebbian rule during a "learning" phase in which examples of input signal plus noise are presented to the network, and by an anti-Hebbian rule during an "unlearning" phase in which examples of noise alone are presented. Each recurrent lateral connection has two values of connection strength, one for each phase; these values are updated by an anti-Hebbian rule.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
The Mathematical Theory of Communication
Shannon, C. E., Weaver, W., & Wiener, N. (1950) · Physics Today · doi:10.1063/1.3067010 · Cited by 9,801
Green, A. A., Berman, M., Switzer, P., & Craig, M. D. (1988) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/36.3001 · Cited by 2,615
Barlow, H. B. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.295 · Cited by 1,650
Self-organization in a perceptual network
Linsker, R. (1988) · Computer · doi:10.1109/2.36 · Cited by 1,469
Self-citationCrick, F., & Mitchison, G. (1983) · Nature · doi:10.1038/304111a0 · Cited by 865
Towards a Theory of Early Visual Processing
Atick, J. J., & Redlich, A. N. (1990) · Neural Computation · doi:10.1162/neco.1990.2.3.308 · Cited by 554
Hinton, G. E., & Sejnowski, J. (1983) · Cited by 498
Pattern-recognizing stochastic learning automata
Barto, A. G., & Anandan, P. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313371 · Cited by 305
Cited by
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
The “independent components” of natural scenes are edge filters
Bell, A. J., & Sejnowski, T. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00121-1 · Cited by 2,201
Independent Component Analysis: Principles and Practice
(2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624148 · Cited by 1,917
Blind separation of auditory event-related brain responses into independent components
Makeig, S., Jung, T.-P., Bell, A. J., Ghahremani, D., & Sejnowski, T. J. (1997) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.94.20.10979 · Cited by 1,206
Blind Source Separation by Sparse Decomposition in a Signal Dictionary
Zibulevsky, M., & Pearlmutter, B. A. (2001) · Neural Computation · doi:10.1162/089976601300014385 · Cited by 766
Metadata
- Authors
- Linsker, R.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1992-09
- Volume
- 4
- Issue
- 5
- Pages
- 691-702
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2123806929
- Cited by
- 280
- References
- 16
- FWCI
- 10.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Local Synaptic Learning Rules Suffice to Maximize Mutual Information in a Linear Network. https://app.cochat.ai/papers/10.1162/neco.1992.4.5.691
- The paper
- Linsker, R. (1992). Local Synaptic Learning Rules Suffice to Maximize Mutual Information in a Linear Network. Neural Computation. https://doi.org/10.1162/neco.1992.4.5.691
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.