State-Dependent Computation Using Coupled Recurrent Networks
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Although conditional branching between possible behavioral states is a hallmark of intelligent behavior, very little is known about the neuronal mechanisms that support this processing. In a step toward solving this problem, we demonstrate by theoretical analysis and simulation how networks of richly interconnected neurons, such as those observed in the superficial layers of the neocortex, can embed reliable, robust finite state machines. We show how a multistable neuronal network containing a number of states can be created very simply by coupling two recurrent networks whose synaptic weights have been configured for soft winner-take-all (sWTA) performance. These two sWTAs have simple, homogeneous, locally recurrent connectivity except for a small fraction of recurrent cross-connections between them, which are used to embed the required states. This coupling between the maps allows the network to continue to express the current state even after the input that elicited that state is withdrawn. In addition, a small number of transition neurons implement the necessary input-driven transitions between the embedded states. We provide simple rules to systematically design and construct neuronal state machines of this kind. The significance of our finding is that it offers a method whereby the cortex could construct networks supporting a broad range of sophisticated processing by applying only small specializations to the same generic neuronal circuit.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
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 · cited 2×
“Another approach has been to project the input into a high dimensional space using randomly connected units (the liquid state machine, LSM) (Maass et al., 2007; Jaeger and Haas, 2004).”
BackgroundDistributed representations, simple recurrent networks, and grammatical structure
Elman, J. L. (1991) · Machine Learning · doi:10.1007/bf00114844 · Cited by 1,354
Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit
Hahnloser, R. H. R., Sarpeshkar, R., Mahowald, M. A., Douglas, R. J., & Seung, H. S. (2000) · Nature · doi:10.1038/35016072 · Cited by 1,293
Self-citationProbabilistic decision making by slow reverberation in cortical circuits
Wang, X.-J. (2002) · Neuron · doi:10.1016/s0896-6273(02)01092-9 · Cited by 1,242
Zhang, K. (1996) · The Journal of Neuroscience · doi:10.1523/jneurosci.16-06-02112.1996 · Cited by 1,001 · cited 2×
“However, when two recurrent maps are combined by some simple recurrent coupling, then their activity can be sustained even in the absence of input (see also (Xie et al., 2002; Zhang, 1996)).”
BackgroundBayesian Computation in Recurrent Neural Circuits
Rao, R. P. N. (2004) · Neural Computation · doi:10.1162/08997660460733976 · Cited by 252 · cited 2×
“In theory, these recurrent circuits exhibit a variety of interesting computations (Abbott, 1994; Douglas, Koch, Mahowald, Martin, & Suarez, 1995; Ben-Yishai, Bar-Or, & Sompolinsky, 1995; Hahnloser, Sarpeshkar, Mahowald, Douglas, & Seung, 2000; Zhaoping, 2001; Pouget, Zhang, Deneve, & Latham, 1998; Machens, Romo, & Bro…”
BackgroundDouble-ring network model of the head-direction system
Xie, X., Hahnloser, R. H. R., & Seung, H. S. (2002) · Physical Review E · doi:10.1103/physreve.66.041902 · Cited by 124 · cited 1×
“However, when two recurrent maps are combined by some simple recurrent coupling, then their activity can be sustained even in the absence of input (see also (Xie et al., 2002; Zhang, 1996)).”
Background
Cited by
Memory and Information Processing in Neuromorphic Systems
Indiveri, G., & Liu, S.-C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2444094 · Cited by 1,037
Why neurons mix: high dimensionality for higher cognition
Fusi, S., Miller, E. K., & Rigotti, M. (2016) · Current Opinion in Neurobiology · doi:10.1016/j.conb.2016.01.010 · Cited by 766
“This kind of mixed selectivity to stimulus identity and to a context signal has been used to model visuomotor remapping [45–48].”
MethodQiao, N., Mostafa, H., Corradi, F., Osswald, M., Stefanini, F., Sumislawska, D., & Indiveri, G. (2015) · Frontiers in Neuroscience · doi:10.3389/fnins.2015.00141 · Cited by 698
Neuromorphic Electronic Circuits for Building Autonomous Cognitive Systems
Chicca, E., Stefanini, F., Bartolozzi, C., & Indiveri, G. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2313954 · Cited by 552
Rapid Neocortical Dynamics: Cellular and Network Mechanisms
Haider, B., & McCormick, D. A. (2009) · Neuron · doi:10.1016/j.neuron.2009.04.008 · Cited by 441
Metadata
- Authors
- Rutishauser, U., & Douglas, R. J.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2009-02
- Volume
- 21
- Issue
- 2
- Pages
- 478-509
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2143614307
- Cited by
- 82
- References
- 11
- FWCI
- 1.95
- 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: State-Dependent Computation Using Coupled Recurrent Networks. https://app.cochat.ai/papers/10.1162/neco.2008.03-08-734
- The paper
- Rutishauser, U., & Douglas, R. J. (2009). State-Dependent Computation Using Coupled Recurrent Networks. Neural Computation. https://doi.org/10.1162/neco.2008.03-08-734
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.