The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract
Reservoir computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron that is trained on top of a randomly connected recurrent neural network. RC systems are commonly used in two flavors: with analog or binary (spiking) neurons in the recurrent circuits. Previous work indicated a fundamental difference in the behavior of these two implementations of the RC idea. The performance of an RC system built from binary neurons seems to depend strongly on the network connectivity structure. In networks of analog neurons, such clear dependency has not been observed. In this letter, we address this apparent dichotomy by investigating the influence of the network connectivity (parameterized by the neuron in-degree) on a family of network models that interpolates between analog and binary networks. Our analyses are based on a novel estimation of the Lyapunov exponent of the network dynamics with the help of branching process theory, rank measures that estimate the kernel quality and generalization capabilities of recurrent networks, and a novel mean field predictor for computational performance. These analyses reveal that the phase transition between ordered and chaotic network behavior of binary circuits qualitatively differs from the one in analog circuits, leading to differences in the integration of information over short and long timescales. This explains the decreased computational performance observed in binary circuits that are densely connected. The mean field predictor is also used to bound the memory function of recurrent circuits of binary neurons.
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
Computation at the edge of chaos: Phase transitions and emergent computation
Langton, C. G. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90064-v · Cited by 1,527
The cost of cortical computation.
Lennie, P. (2003) · Current Biology · doi:10.1016/s0960-9822(03)00135-0 · Cited by 1,134 · cited 1×
“It has often been suggested that this sparse activity is due to metabolic cost and energy constrains (see Levy & Baxter, 1996; Laughlin, de Ruyter van Steveninck, & Anderson, 1998; Lennie, 2003).”
BackgroundDeFelipe, J., & Fariñas, I. (1992) · Progress in Neurobiology · doi:10.1016/0301-0082(92)90015-7 · Cited by 975
Optimization and applications of echo state networks with leaky- integrator neurons
Jaeger, H., Lukoševičius, M., Popovici, D., & Siewert, U. (2007) · Neural Networks · doi:10.1016/j.neunet.2007.04.016 · Cited by 948 · cited 3×
“…optimization has become quite standard for ESNs (Triesch, 2007; Steil, 2007; Schrauwen, Wardermann, Verstraeten, Steil, & Stroobandt, 2008; see Lukoˇseviˇcius & Jaeger, 2007, for a review); for LSMs, interesting steps in this direction have been undertaken, among others, in Natschl¨ager,…”
BackgroundMethodReal-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
Vogels, T. P., Rajan, K., & Abbott, L. F. (2005) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.28.061604.135637 · Cited by 497
Cited by
Recent advances in physical reservoir computing: A review
Tanaka, G., Yamane, T., Héroux, J. B., Nakane, R., Kanazawa, N., Takeda, S., Numata, H., Nakano, D., & Hirose, A. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.03.005 · Cited by 2,146
Re-visiting the echo state property
Yildiz, I. B., Jaeger, H., & Kiebel, S. J. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.07.005 · Cited by 486
Information processing in echo state networks at the edge of chaos
Boedecker, J., Obst, O., Lizier, J. T., Mayer, N. M., & Asada, M. (2012) · Theory in Biosciences · doi:10.1007/s12064-011-0146-8 · Cited by 297
A theoretical and experimental study of neuromorphic atomic switch networks for reservoir computing
Sillin, H. O., Aguilera, R., Shieh, H.-H., Avizienis, A. V., Aono, M., Stieg, A. Z., & Gimzewski, J. K. (2013) · Nanotechnology · doi:10.1088/0957-4484/24/38/384004 · Cited by 254
Applications of Metaheuristics in Reservoir Computing Techniques: A Review
Bala, A., Ismail, I., Ibrahim, R., & Sait, S. M. (2018) · IEEE Access · doi:10.1109/access.2018.2873770 · Cited by 53
Metadata
- Authors
- Büsing, L., Schrauwen, B., & Legenstein, R.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2010-05
- Volume
- 22
- Issue
- 5
- Pages
- 1272-1311
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2134603460
- Cited by
- 177
- References
- 8
- FWCI
- 5.78
- 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: Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons. https://app.cochat.ai/papers/10.1162/neco.2009.01-09-947
- The paper
- Büsing, L., Schrauwen, B., & Legenstein, R. (2010). Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons. Neural Computation. https://doi.org/10.1162/neco.2009.01-09-947
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.