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

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

Memory Dynamics in Attractor Networks with Saliency Weights

Tang, Huajin, Li, Haizhou, Yan, Rui · 2010 · Neural Computation

Abstract

Memory is a fundamental part of computational systems like the human brain. Theoretical models identify memories as attractors of neural network activity patterns based on the theory that attractor (recurrent) neural networks are able to capture some crucial characteristics of memory, such as encoding, storage, retrieval, and long-term and working memory. In such networks, long-term storage of the memory patterns is enabled by synaptic strengths that are adjusted according to some activity-dependent plasticity mechanisms (of which the most widely recognized is the Hebbian rule) such that the attractors of the network dynamics represent the stored memories. Most of previous studies on associative memory are focused on Hopfield-like binary networks, and the learned patterns are often assumed to be uncorrelated in a way that minimal interactions between memories are facilitated. In this letter, we restrict our attention to a more biological plausible attractor network model and study the neuronal representations of correlated patterns. We have examined the role of saliency weights in memory dynamics. Our results demonstrate that the retrieval process of the memorized patterns is characterized by the saliency distribution, which affects the landscape of the attractors. We have established the conditions that the network state converges to unique memory and multiple memories. The analytical result also holds for other cases for variable coding levels and nonbinary levels, indicating a general property emerging from correlated memories. Our results confirmed the advantage of computing with graded-response neurons over binary neurons (i.e., reducing of spurious states). It was also found that the nonuniform saliency distribution can contribute to disappearance of spurious states when they exit.

Overview

Integrity signals

Registry

Crossref · 10.1162/neco.2010.07-09-1050

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 35 references

Research works printed but not linked: 1

  1. Treves A., 1991, Network, 2, 371

Cited by

See all 34

Metadata

Authors
Tang, H., Li, H., & Yan, R.
Affiliations
Agency for Science, Technology and Research (SG)
Venue
Neural Computation
Published
2010-07
Volume
22
Issue
7
Pages
1899-1926
ISSN
  • 0899-7667 (ISSN-L)
  • 1530-888X
OpenAlex
W2136255270
Cited by
34
References
35
Citations by year
2026: 1 · 2025: 2 · 2024: 1 · 2023: 1 · 2022: 3 · 2020: 1 · 2019: 1 · 2017: 3 · 2016: 3 · 2015: 2 · 2014: 2 · 2013: 6 · 2012: 6
FWCI
4.73
Type
journal article
Language
en
Open access
closed
Locations
  • Neural Computation (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Neural dynamics and brain function
  • Life Sciences › Neuroscience › Cognitive Neuroscience › Memory and Neural Mechanisms
Keywords
attractor networks, memory dynamics, associative memory, memory retrieval, spurious states, Hebbian plasticity, attractor landscape, Hopfield neural network
MeSH terms
Action Potentials, Animals, Computer Simulation, Humans, Memory, Nerve Net, Synaptic Transmission, Neuronal Plasticity, Neurons, Neural Networks, Computer, Nonlinear Dynamics

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: Memory Dynamics in Attractor Networks with Saliency Weights. https://app.cochat.ai/papers/10.1162/neco.2010.07-09-1050
The paper
Tang, H., Li, H., & Yan, R. (2010). Memory Dynamics in Attractor Networks with Saliency Weights. Neural Computation. https://doi.org/10.1162/neco.2010.07-09-1050

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.