Reproducible Sequence Generation In Random Neural Ensembles
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Little is known about the conditions that neural circuits have to satisfy to generate reproducible sequences. Evidently, the genetic code cannot control all the details of the complex circuits in the brain. In this Letter, we give the conditions on the connectivity degree that lead to reproducible and robust sequences in a neural population of randomly coupled excitatory and inhibitory neurons. In contrast to the traditional theoretical view we show that the sequences do not need to be learned. In the framework proposed here just the averaged characteristics of the random circuits have to be under genetic control. We found that rhythmic sequences can be generated if random networks are in the vicinity of an excitatory-inhibitory synaptic balance. Reproducible transient sequences, on the other hand, are found far from a synaptic balance.
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
Maass, W., Natschläger, T., & Markram, H. (2002) · Neural Computation · doi:10.1162/089976602760407955 · Cited by 4,025
Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811
Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks
Bertschinger, N., & Natschläger, T. (2004) · Neural Computation · doi:10.1162/089976604323057443 · Cited by 833
Cited by
Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks
Bertschinger, N., & Natschläger, T. (2004) · Neural Computation · doi:10.1162/089976604323057443 · Cited by 833
Dynamical principles in neuroscience
Rabinovich, M. I., Varona, P., Selverston, A. I., & Abarbanel, H. D. I. (2006) · Reviews of Modern Physics · doi:10.1103/revmodphys.78.1213 · Cited by 824
Self-citationOpening the black box: low-dimensional dynamics in high-dimensional recurrent neural networks
Sussillo, D., & Barak, O. (2013) · Neural Computation · doi:10.1162/neco_a_00409 · Cited by 575
“…therefore initially their implementation was unknown, our method and results are compatible with studies attempting to understand biological neural circuits, for example (Huerta & Rabinovich, 2004; Machens, Romo, & Brody, 2005; Rabinovich et al., 2008; Liu & Buonomano, 2009; Ponzi & Wickens, 2010).”
ResultTransient Dynamics for Neural Processing
Rabinovich, M., Huerta, R., & Laurent, G. (2008) · Science · doi:10.1126/science.1155564 · Cited by 491
Self-citationTransient Cognitive Dynamics, Metastability, and Decision Making
Rabinovich, M. I., Huerta, R., Varona, P., & Afraimovich, V. S. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000072 · Cited by 349
Self-citation
Metadata
- Authors
- Huerta, R., & Rabinovich, M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-12-02
- Volume
- 93
- Issue
- 23
- Pages
- 238104-238104
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2081295160
- Cited by
- 77
- References
- 3
- FWCI
- 1.92
- Type
- journal article
- Language
- en
- Open access
- bronze
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.