Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 173

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Quantitative study of attractor neural networks retrieving at low spike rates: II. Low-rate retrieval in symmetric networks

Amit, Daniel, Tsodyks, M·1991·Network: Computation in Neural Systems

Abstract

A network of current-rate dynamics with a symmetric synaptic matrix is analysed and simulated for its low-rate attractor structure. The dynamics is deterministic, with the noise included in a realistic current-rate transduction function (discussed in part I)The analysis is carried out in mean-field theory. It is shown that at low loading the network retrieves without errors, with uniform low rates, that there are no simple spurious states and that the low-rate attractors, retrieving single patterns, are stable to the admixture of additional patterns. The analysis of the attractors in a network with an extensive number of patterns is carried out in the replica symmetric approximations. The results for the dependence of the retrieval rates on loading level; for the distribution of rates among neurons, as well as for the storage capacity are compared with simulations. Simulations also show that retriewal performance is very robust to random elimination of synapses. Moreover, errors in the stimulus, relative to the stored patterns, are very rapidly corrected.It is shown that memory saturation expresses itself either in a drift toward a quiescent state, or in the freezing of rates in the two classes of neurons in a pattern in the foreground and in the background. Freezing means that in each class a subset of neurons are active at high rates and the others are quiescent. The two activity distributions become indistinguishable

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/0954-898x/2/3/004

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 173

Metadata

Authors
Amit, D., & Tsodyks, M.
Venue
Network: Computation in Neural Systems
Published
1991-08-01
Volume
2
Issue
3
Pages
275-294
ISSN
  • 0954-898X (ISSN-L)
  • 1361-6536
OpenAlex
W2155598451
Cited by
173
References
3
FWCI
7.95
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: Quantitative study of attractor neural networks retrieving at low spike rates: II. Low-rate retrieval in symmetric networks. https://app.cochat.ai/papers/10.1088/0954-898x/2/3/004
The paper
Amit, D., & Tsodyks, M. (1991). Quantitative study of attractor neural networks retrieving at low spike rates: II. Low-rate retrieval in symmetric networks. Network: Computation in Neural Systems. https://doi.org/10.1088/0954-898x/2/3/004

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.