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

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

Information storage in neural networks with low levels of activity

Amit, Daniel J., Gutfreund, Hanoch, Sompolinsky, H.·1987·Physical Review A

Abstract

The Hopfield model of a neural network is extended to allow for the storage and retrieval of biased patterns, {${\ensuremath{\xi}}_{i}^{\ensuremath{\mu}}$}, where ${N}^{\mathrm{\ensuremath{-}}1}$${\mathcal{J}}_{i}^{N}$${\ensuremath{\xi}}_{i}^{\ensuremath{\mu}}$=a is arbitrary. Such patterns represent levels of activity (i.e., percentage of firing neurons) equal to (1/2)(1+a), -1<a<1. If the coupling constants (synaptic efficacies) are constructed as in the original Hopfield model, the system can retrieve at most a very small number of patterns (p1+${a}^{\mathrm{\ensuremath{-}}2}$). This is due to the finite correlations (overlaps) between the patterns. The model is modified by subtracting the bias a from each pattern as it enters into the couplings. This modification restores the ability of the model to store a macroscopic number of patterns. Yet spurious states are found to plague the dynamics. It is then argued that the dynamics of the network should be consistent with the levels of activity of the stored patterns. This is implemented by adding a global constraint, which restricts the configuration space to states whose mean activity is in the neighborhood of (1/2)(1+a). The consequences of the restricted dynamics are analyzed in the replica symmetric mean-field theory. The global constraint suppresses spurious states and leads to the unexpected result that the storage capacity is higher than that of the unbiased network, up to very high values of the bias (\ensuremath{\Vert}a\ensuremath{\Vert}\ensuremath{\simeq}0.99). However, the information content of such networks is shown to be a monotonically decreasing function of a.

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.1103/physreva.35.2293

Cites

15 of 15 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 15 references

Research works printed but not linked: 1

  1. G. Weisbuch, 1985, J. Phys. (Paris) Lett., 46, L, 10.1051/jphyslet:019850046014062300 · doi:10.1051/jphyslet:019850046014062300

Cited by

See all 329

Metadata

Authors
Amit, D. J., Gutfreund, H., & Sompolinsky, H.
Venue
Physical Review A
Published
1987-03-01
Volume
35
Issue
5
Pages
2293-2303
ISSN
0556-2791 (ISSN-L)
OpenAlex
W1966240450
Cited by
329
References
15
FWCI
29.93
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: Information storage in neural networks with low levels of activity. https://app.cochat.ai/papers/10.1103/physreva.35.2293
The paper
Amit, D. J., Gutfreund, H., & Sompolinsky, H. (1987). Information storage in neural networks with low levels of activity. Physical Review A. https://doi.org/10.1103/physreva.35.2293

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.