Journal of NeuroscienceNeurosciencePeer-reviewed journal article
Recurrent neural circuits overcome partial inactivation by compensation and re-learning
Abstract
1Technical advances in artificial manipulation of neural activity have precipitated a surge in studying the causal contribution of brain circuits to cognition and behavior. However, complexities of neural circuits challenge interpretation of experimental results, necessitating theoretical frameworks for system-atic explorations. Here, we take a step in this direction, using, as a testbed, recurrent neural networks trained to perform a perceptual decision. We show that understanding the computations implemented by network dynamics enables predicting the magnitude of perturbation effects based on changes in the networks phase plane. Inactivation effects are weaker for distributed network architectures, are more easily discovered with non-discrete behavioral readouts (e.g., reaction times), and vary considerably across multiple tasks implemented by the same circuit. Finally, networks that can "learn" during inactivation recover function quickly, often much faster than the original training time. Our framework explains past empirical observations by clarifying how complex circuits compensate and adapt to perturbations.
- Citations
- 3
- FWCI
- 0.48
- Field percentile
- top 44%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks
Thomas Miconi·eLifePeer-reviewed·Feb 23, 2017
- Structure, disorder, and dynamics in task-trained recurrent neural circuits
D Clark, Blake Bordelon, … Cengiz Pehlevan·bioRxiv·May 18, 2026
- Interpretable compositional computation with recurrent neural networks
Louis Pezon, Alexander van Meegen·bioRxiv·Jun 29, 2026
- Searching for Principles of Brain Computation
Wolfgang Maass·bioRxiv·Dec 14, 2016
- Inhibitory-stabilization is sufficient for history-dependent computation in a randomly connected attractor network
Caelen J. Hilty, Paul Miller·Journal of Computational NeurosciencePeer-reviewed·Mar 19, 2026
- Partial recurrence enables robust and efficient computation
Marcus Ghosh, Dan F. M. Goodman·bioRxiv·Jul 28, 2025