Evidence map›Paper›PMID 42239479›Full record

ArticlebioRxiv : the preprint server for biology2026

Structure, disorder, and dynamics in task-trained recurrent neural circuits.

David G Clark, Blake Bordelon, Jacob A Zavatone-Veth, Cengiz Pehlevan

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

4 authors.

David G ClarkKempner Institute for the Study of Natural and Artificial Intelligence, Harvard University, Cambridge, MA, USA.ORCID 0000-0002-2397-6992
Blake BordelonCenter of Mathematical Sciences and Applications, Harvard University, Cambridge, MA, USA.ORCID 0000-0003-0455-9445
Jacob A Zavatone-VethSociety of Fellows, Harvard University, Cambridge, MA, USA.ORCID 0000-0002-4060-1738
Cengiz PehlevanKempner Institute for the Study of Natural and Artificial Intelligence, Harvard University, Cambridge, MA, USA.ORCID 0000-0001-9767-6063

Funding

Understanding data-driven models for neural dynamicsDP5OD037354 · OD · HARVARD UNIVERSITY · PI Jacob Andreas Zavatone-Veth · 2024 to 2026
$1.3M
NIH HHS DP5 OD037354
6 · The paper itself

Abstract

Across many brain areas, neurons produce heterogeneous, seemingly disordered responses. Yet such circuits cannot be purely random, since they must possess some structure to generate the representations and computations underlying behavior. How much structure is present in recurrent connectivity relative to disorder, and how the interaction between the two shapes population dynamics and single-neuron responses, remain incompletely understood. Recurrent neural networks trained to perform tasks have become a leading model of such circuits, but conventional training yields a single point in a vast space of task-compatible solutions, with no systematic way to explore this space and no theory of how internal representations vary within it. Without such a theory, the questions above cannot be addressed, and comparisons between trained networks and neural data are difficult to interpret. Here, we introduce a control parameter that governs the degree to which learning reshapes recurrent connectivity, interpolating between a reservoir regime and one in which recurrent weights are restructured by learning to produce task-relevant internal representations. Varying this parameter generates a family of task-compatible solutions whose internal dynamics differ in a controlled and interpretable way. We derive a dynamical mean-field theory showing that, while population-level dynamics converge to a deterministic limit, individual neurons are driven by independent samples from a single-neuron input-current distribution. When connectivity is random, this distribution is Gaussian. Recurrent restructuring drives it toward task-dependent, non-Gaussian forms. In linear networks, restructuring amplifies task-relevant frequencies. In nonlinear networks, it drives a phase transition from chaotic, high-dimensional activity to ordered, low-dimensional dynamics that generalize temporally beyond the training period. We apply the theory to a reaching task in which a recurrent network must reproduce macaque muscle activity, and find that optimally matching simultaneous motor-cortex recordings requires only a small degree of restructuring, with learned structure coexisting with random heterogeneity. These results suggest a broader picture in which large recurrent circuits are largely random but contain, to varying degrees, structured recurrent connectivity sufficient for generalizable, task-relevant representations.

Identifiers

PMID42239479
PMCPMC13228304

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.