STDP Installs in Winner-Take-All Circuits an Online Approximation to Hidden Markov Model Learning
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
In order to cross a street without being run over, we need to be able to extract very fast hidden causes of dynamically changing multi-modal sensory stimuli, and to predict their future evolution. We show here that a generic cortical microcircuit motif, pyramidal cells with lateral excitation and inhibition, provides the basis for this difficult but all-important information processing capability. This capability emerges in the presence of noise automatically through effects of STDP on connections between pyramidal cells in Winner-Take-All circuits with lateral excitation. In fact, one can show that these motifs endow cortical microcircuits with functional properties of a hidden Markov model, a generic model for solving such tasks through probabilistic inference. Whereas in engineering applications this model is adapted to specific tasks through offline learning, we show here that a major portion of the functionality of hidden Markov models arises already from online applications of STDP, without any supervision or rewards. We demonstrate the emergent computing capabilities of the model through several computer simulations. The full power of hidden Markov model learning can be attained through reward-gated STDP. This is due to the fact that these mechanisms enable a rejection sampling approximation to theoretically optimal learning. We investigate the possible performance gain that can be achieved with this more accurate learning method for an artificial grammar task.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187 · cited 2×
“…the recurrent and the feedforward synaptic connections – realizes theoretically optimal parameter acquisition in terms of an online expectation-maximization (EM) algorithm [21,22], for a certain pair S , X if the stochastic network dynamics describes the state sequence S upon the input sequence X .”
BackgroundMethodImplicit learning of artificial grammars
Reber, A. S. (1967) · Journal of Verbal Learning and Verbal Behavior · doi:10.1016/s0022-5371(67)80149-x · Cited by 2,026
Spike Timing–Dependent Plasticity: A Hebbian Learning Rule
Caporale, N., & Dan, Y. (2008) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.31.060407.125639 · Cited by 1,997 · cited 2×
“This term is commonly found in synaptic plasticity measured in biological neurons, and for common EPSP windows it closely resembles the shape of the pre-before-post part of standard forms of STDP [11,12].”
BackgroundMethodCoordinated memory replay in the visual cortex and hippocampus during sleep
Ji, D., & Wilson, M. A. (2007) · Nature Neuroscience · doi:10.1038/nn1825 · Cited by 1,669 · cited 1×
“This view is also supported by findings that showed that coordinated reactivation of temporal patterns can be observed in the cortex [8,9,67,68].”
ResultThe importance of mixed selectivity in complex cognitive tasks
Rigotti, M., Barak, O., Warden, M. R., Wang, X.-J., Daw, N. D., Miller, E. K., & Fusi, S. (2013) · Nature · doi:10.1038/nature12160 · Cited by 1,639 · cited 3×
“One feature is that neurons become tuned for mixtures of different task-relevant aspects as commonly observed in cortical neurons [25,34,36].”
BackgroundReplay of rule-learning related neural patterns in the prefrontal cortex during sleep
Peyrache, A., Khamassi, M., Benchenane, K., Wiener, S. I., & Battaglia, F. P. (2009) · Nature Neuroscience · doi:10.1038/nn.2337 · Cited by 767
Spontaneous Events Outline the Realm of Possible Sensory Responses in Neocortical Populations
Luczak, A., Barthó, P., & Harris, K. D. (2009) · Neuron · doi:10.1016/j.neuron.2009.03.014 · Cited by 593 · cited 3×
“The spike statistics were estimated using the perievent time histogram (PETH) on the network output [6].”
BackgroundMethodInfluentialSequential structure of neocortical spontaneous activity in vivo
Luczak, A., Barthó, P., Marguet, S. L., Buzsáki, G., & Harris, K. D. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605643104 · Cited by 515
A history of spike-timing-dependent plasticity
Markram, H. (2011) · Frontiers in Synaptic Neuroscience · doi:10.3389/fnsyn.2011.00004 · Cited by 454 · cited 2×
“This term is commonly found in synaptic plasticity measured in biological neurons, and for common EPSP windows it closely resembles the shape of the pre-before-post part of standard forms of STDP [11,12].”
BackgroundMethod
Cited by
Deep learning in spiking neural networks
Tavanaei, A., Ghodrati, M., Kheradpisheh, S. R., Masquelier, T., & Maida, A. (2019) · Neural Networks · doi:10.1016/j.neunet.2018.12.002 · Cited by 1,386
Opportunities for neuromorphic computing algorithms and applications
Schuman, C. D., Kulkarni, S. R., Parsa, M., Mitchell, J. P., Date, P., & Kay, B. (2022) · Nature Computational Science · doi:10.1038/s43588-021-00184-y · Cited by 1,117
“Such recurrent SNNs have shown greater classification ability with winner-take-all models 76–78 .”
BackgroundFlexible Neuromorphic Electronics for Computing, Soft Robotics, and Neuroprosthetics
Park, H., Lee, Y., Kim, N., Seo, D., Go, G., & Lee, T. (2020) · Advanced Materials · doi:10.1002/adma.201903558 · Cited by 533
Serb, A., Bill, J., Khiat, A., Berdan, R., Legenstein, R., & Prodromakis, T. (2016) · Nature Communications · doi:10.1038/ncomms12611 · Cited by 339
Toward an integration of deep learning and neuroscience
Marblestone, A. H., Wayne, G., & Kording, K. P. (2016) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2016.00094 · Cited by 119
Metadata
- Authors
- Kappel, D., Nessler, B., & Maass, W.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2014-03-27
- Volume
- 10
- Issue
- 3
- Pages
- e1003511
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2050689535
- Cited by
- 119
- References
- 20
- FWCI
- 8.85
- Type
- journal article
- Language
- en
- Open access
- gold
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.