.png){kind=icon}
.png){kind=icon}
Return
Optimal Sequence Memory in Driven Random Networks
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevX.8.041029.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Autonomous, randomly coupled, neural networks display a transition to chaos at a critical coupling strength. Here, we investigate the effect of a time-varying input on the onset of chaos and the resulting consequences for information processing. Dynamic mean-field theory yields the statistics of the activity, the maximum Lyapunov exponent, and the memory capacity of the network. We find an exact condition that determines the transition from stable to chaotic dynamics and the sequential memory capacity in closed form. The input suppresses chaos by a dynamic mechanism, shifting the transition to significantly larger coupling strengths than predicted by local stability analysis. Beyond linear stability, a regime of coexistent locally expansive but nonchaotic dynamics emerges that optimizes the capacity of the network to store sequential input.
Keywords:
FIELD-THEORY
DYNAMICS
CHAOS
MODELS
COMPUTATION
EDGE
RENORMALIZATION
CONNECTIVITY
PATTERNS
SYSTEMS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.