Evidence map›Paper›PMID 38844437›Full record

ArticleNature communications2024

Reservoir-computing based associative memory and itinerancy for complex dynamical attractors.

Ling-Wei Kong, Gene A Brewer, Ying-Cheng Lai

Abstract read
In one paragraph

Article in Nature communications, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Linearizing and Forecasting: A Reservoir Computing Route to Digital Twins of the Brain.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2026
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Ling-Wei KongDepartment of Computational Biology, Cornell University, Ithaca, New York, USA.ORCID http://orcid.org/0000-0002-8921-1642
Gene A BrewerDepartment of Psychology, Arizona State University, Tempe, Arizona, USA.
Ying-Cheng LaiSchool of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, Arizona, USA. Ying-Cheng.Lai@asu.edu.ORCID http://orcid.org/0000-0002-0723-733X

Funding

United States Department of Defense | United States Air Force | AFMC | Air Force Office of Scientific Research (AF Office of Scientific Research) FA9550-21-1-0438
6 · The paper itself

Abstract

Traditional neural network models of associative memories were used to store and retrieve static patterns. We develop reservoir-computing based memories for complex dynamical attractors, under two common recalling scenarios in neuropsychology: location-addressable with an index channel and content-addressable without such a channel. We demonstrate that, for location-addressable retrieval, a single reservoir computing machine can memorize a large number of periodic and chaotic attractors, each retrievable with a specific index value. We articulate control strategies to achieve successful switching among the attractors, unveil the mechanism behind failed switching, and uncover various scaling behaviors between the number of stored attractors and the reservoir network size. For content-addressable retrieval, we exploit multistability with cue signals, where the stored attractors coexist in the high-dimensional phase space of the reservoir network. As the length of the cue signal increases through a critical value, a high success rate can be achieved. The work provides foundational insights into developing long-term memories and itinerancy for complex dynamical patterns.

Identifiers

PMID38844437
PMCPMC11156990

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.