Beyond the edge of chaos: Amplification and temporal integration by recurrent networks in the chaotic regime
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Randomly connected networks of neurons exhibit a transition from fixed-point to chaotic activity as the variance of their synaptic connection strengths is increased. In this study, we analytically evaluate how well a small external input can be reconstructed from a sparse linear readout of network activity. At the transition point, known as the edge of chaos, networks display a number of desirable features, including large gains and integration times. Away from this edge, in the nonchaotic regime that has been the focus of most models and studies, gains and integration times fall off dramatically, which implies that parameters must be fine tuned with considerable precision if high performance is required. Here we show that, near the edge, decoding performance is characterized by a critical exponent that takes a different value on the two sides. As a result, when the network units have an odd saturating nonlinear response function, the falloff in gains and integration times is much slower on the chaotic side of the transition. This means that, under appropriate conditions, good performance can be achieved with less fine tuning beyond the edge, within the chaotic regime.
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
Chaos in random neural networks
Sompolinsky, H., Crisanti, A., & Sommers, H. J. (1988) · Physical Review Letters · doi:10.1103/physrevlett.61.259 · Cited by 1,061
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
Colloquium: Criticality and dynamical scaling in living systems
Muñoz, M. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.031001 · Cited by 530
Physical reservoir computing—an introductory perspective
Nakajima, K. (2020) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ab8d4f · Cited by 422
Two types of asynchronous activity in networks of excitatory and inhibitory spiking neurons
Ostojic, S. (2014) · Nature Neuroscience · doi:10.1038/nn.3658 · Cited by 303
How critical is brain criticality?
O’Byrne, J., & Jerbi, K. (2022) · Trends in Neurosciences · doi:10.1016/j.tins.2022.08.007 · Cited by 258
Stimulus-specific hypothalamic encoding of a persistent defensive state
Kennedy, A., Kunwar, P. S., Li, L.-Y., Stagkourakis, S., Wagenaar, D. A., & Anderson, D. J. (2020) · Nature · doi:10.1038/s41586-020-2728-4 · Cited by 144
Topological and Dynamical Complexity of Random Neural Networks
Wainrib, G., & Touboul, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.118101 · Cited by 124
Synaptic basis of a sub-second representation of time in a neural circuit model
Barri, A., Wiechert, M. T., Jazayeri, M., & DiGregorio, D. A. (2022) · Nature Communications · doi:10.1038/s41467-022-35395-y · Cited by 43
Metadata
- Authors
- Toyoizumi, T., & Abbott, L. F.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-11-14
- Volume
- 84
- Issue
- 5
- Pages
- 051908-051908
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2331219843
- Cited by
- 140
- References
- 4
- FWCI
- 2.11
- 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
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.