Generalized Bienenstock–Cooper–Munro rule for spiking neurons that maximizes information transmission
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Maximization of information transmission by a spiking-neuron model predicts changes of synaptic connections that depend on timing of pre- and postsynaptic spikes and on the postsynaptic membrane potential. Under the assumption of Poisson firing statistics, the synaptic update rule exhibits all of the features of the Bienenstock–Cooper–Munro rule, in particular, regimes of synaptic potentiation and depression separated by a sliding threshold. Moreover, the learning rule is also applicable to the more realistic case of neuron models with refractoriness, and is sensitive to correlations between input spikes, even in the absence of presynaptic rate modulation. The learning rule is found by maximizing the mutual information between presynaptic and postsynaptic spike trains under the constraint that the postsynaptic firing rate stays close to some target firing rate. An interpretation of the synaptic update rule in terms of homeostatic synaptic processes and spike-timing-dependent plasticity is discussed.
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
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
Bienenstock, E., Cooper, L., & Munro, P. (1982) · The Journal of Neuroscience · doi:10.1523/jneurosci.02-01-00032.1982 · Cited by 2,896
Long-Term Potentiation--A Decade of Progress?
Malenka, R. C., & Nicoll, A. R. A. (1999) · Science · doi:10.1126/science.285.5435.1870 · Cited by 2,729
Homeostatic plasticity in the developing nervous system
Turrigiano, G. G., & Nelson, S. B. (2004) · Nature Reviews Neuroscience · doi:10.1038/nrn1327 · Cited by 2,485
Cited by
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Probabilistic brains: knowns and unknowns
Pouget, A., Beck, J. M., Ma, W. J., & Latham, P. E. (2013) · Nature Neuroscience · doi:10.1038/nn.3495 · Cited by 615
“This approach often yields learning rules that are roughly consistent with those found in biology, such as long-term potentiation and long-term depression 67 , and, in some cases, even an approximation to spike timing–dependent plasticity 68,69 .”
BackgroundPhenomenological models of synaptic plasticity based on spike timing
Morrison, A., Diesmann, M., & Gerstner, W. (2008) · Biological Cybernetics · doi:10.1007/s00422-008-0233-1 · Cited by 593
Self-citationA history of spike-timing-dependent plasticity
Markram, H. (2011) · Frontiers in Synaptic Neuroscience · doi:10.3389/fnsyn.2011.00004 · Cited by 454
“…may thus play a vital role in ensuring that synaptic plasticity rules do not drive synaptic weights into a range where the neuron cannot be driven to fire at all, or becomes excessively sensitive to any input (Toyoizumi et al., 2005, 2007a; Clopath and Gerstner, 2010; Clopath et al., 2010).”
BackgroundMemristors for Energy‐Efficient New Computing Paradigms
Jeong, D. S., Kim, K. M., Kim, S., Choi, B. J., & Hwang, C. S. (2016) · Advanced Electronic Materials · doi:10.1002/aelm.201600090 · Cited by 413
Metadata
- Authors
- Toyoizumi, T., Pfister, J.-P., Aihara, K., & Gerstner, W.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2005-03-28
- Volume
- 102
- Issue
- 14
- Pages
- 5239-5244
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2136175743
- Cited by
- 123
- References
- 4
- FWCI
- 3.89
- Type
- journal article
- Language
- en
- Open access
- green
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: Generalized Bienenstock–Cooper–Munro rule for spiking neurons that maximizes information transmission. https://app.cochat.ai/papers/10.1073/pnas.0500495102
- The paper
- Toyoizumi, T., Pfister, J.-P., Aihara, K., & Gerstner, W. (2005). Generalized Bienenstock–Cooper–Munro rule for spiking neurons that maximizes information transmission. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0500495102
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.