The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
Abstract
The richness and complexity of recurrent cortical circuits is an inexhaustible source of inspiration for thinking about high-level biological computation. In past theoretical studies, constraints on the synaptic connection patterns of threshold-linear networks were found that guaranteed bounded network dynamics, convergence to attractive fixed points, and multistability, all fundamental aspects of cortical information processing. However, these conditions were only sufficient, and it remained unclear which were the minimal (necessary) conditions for convergence and multistability. We show that symmetric threshold-linear networks converge to a set of attractive fixed points if and only if the network matrix is copositive. Furthermore, the set of attractive fixed points is nonconnected (the network is multiattractive) if and only if the network matrix is not positive semidefinite. There are permitted sets of neurons that can be coactive at a stable steady state and forbidden sets that cannot. Permitted sets are clustered in the sense that subsets of permitted sets are permitted and supersets of forbidden sets are forbidden. By viewing permitted sets as memories stored in the synaptic connections, we provide a formulation of long-term memory that is more general than the traditional perspective of fixed-point attractor networks. There is a close correspondence between threshold-linear networks and networks defined by the generalized Lotka-Volterra equations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
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-citationHow the brain keeps the eyes still
Seung, H. S. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.23.13339 · Cited by 534
Self-citation
Cited by
(2010) · International Conference on Machine Learning · Cited by 13,995
BASNet: Boundary-Aware Salient Object Detection
Qin, X., Zhang, Z., Huang, C., Gao, C., Dehghan, M., & Jagersand, M. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00766 · Cited by 1,565
Project Adam: building an efficient and scalable deep learning training system
Chilimbi, T. M., Suzue, Y., Apacible, J., & Kalyanaraman, K. (2014) · Operating Systems Design and Implementation · doi:10.5555/2685048.2685094 · Cited by 550
On partial contraction analysis for coupled nonlinear oscillators
Wang, W., & Slotine, J.-J. E. (2005) · Biological Cybernetics · doi:10.1007/s00422-004-0527-x · Cited by 545
Self-citationVogels, T. P., Rajan, K., & Abbott, L. F. (2005) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.28.061604.135637 · Cited by 497
Metadata
- Authors
- Hahnloser, R. H. R., Seung, H. S., & Slotine, J.-J.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2003-03-01
- Volume
- 15
- Issue
- 3
- Pages
- 621-638
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2115761837
- Cited by
- 202
- References
- 4
- FWCI
- 1.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: Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks. https://app.cochat.ai/papers/10.1162/089976603321192103
- The paper
- Hahnloser, R. H. R., Seung, H. S., & Slotine, J.-J. (2003). Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks. Neural Computation. https://doi.org/10.1162/089976603321192103
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.