Linear equivalence of nonlinear recurrent neural networks
David G. Clark

TL;DR
This paper demonstrates that large nonlinear recurrent neural networks can be analytically approximated by linear networks with equivalent covariance structures, using cavity methods to derive the key equations.
Contribution
It provides a rigorous derivation of the linear equivalence ansatz for recurrent networks, extending previous results from feedforward to recurrent architectures.
Findings
The covariance matrix of a nonlinear recurrent network matches that of a linear network with the same couplings.
The cavity method reveals an emergent external drive influencing the covariance structure.
Simulations confirm the theoretical predictions of the covariance equivalence.
Abstract
Large nonlinear recurrent neural networks with random couplings generate high-dimensional, potentially chaotic activity whose structure is of interest in neuroscience and other fields. A fundamental object encoding the collective structure of this activity is the covariance matrix. Prior analytical work on the covariance matrix has been limited to low-dimensional summary statistics. Recent work proposed an ansatz in which, at large , the covariance matrix for a typical quenched realization takes the same form as that of a linear network with the same couplings, driven by independent noise, with DMFT order parameters setting the transfer function and the noise spectrum. Here, we derive this ansatz using the two-site cavity method, providing two derivations with complementary perspectives. The first decomposes each unit's activity into a linear response to its local field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
