Dynamics of random recurrent neural networks: colored noise and sublinear activations
summary
The gist
The gist: The study determines stationary correlations and distinguishes between local linear stability and chaos in recurrent neural networks with random couplings, sublinear activations, and
In short
The study investigates recurrent neural networks with random connections, sublinear activation functions, and temporally correlated noise to find stationary correlations and distinguish between local instability and chaos. Key findings show that finite correlation time in internal noise cuts off the divergence of the network's intrinsic correlation time near chaos, exhibiting a specific scaling $ au_{corr,max} au ext{propto } 1/ ext{sqrt}(D_0)$.
Key concepts
- Local Linear Stability
- This refers to whether small perturbations around a steady state in the network decay or grow locally. It is defined by a criterion that determines if the system is stable or unstable at a specific point, setting the first dynamical threshold for network behavior.
- Largest Lyapunov Exponent ($ ext{LLE}$)
- The LLE measures how quickly nearby trajectories in the network's dynamics diverge over time. A positive LLE signifies chaotic behavior, indicating sensitive dependence on initial conditions, which is the second dynamical threshold studied in this work.
- Intrinsic Correlation Time ($ au_{corr}$)
- This timescale characterizes how long the internal correlations within the network activity persist before decorrelating. It is a crucial observable that reveals temporal memory in the system and shows universal scaling properties near chaos, particularly how it is affected by noise strength.
Terminology used across episodes
This episode discusses
- Dynamics of random recurrent neural networks: colored noise and sublinear activations · Paper Radio
- A Critical Review of Recurrent Neural Networks for Sequence Learning
- Covariance spectrum in nonlinear recurrent neural networks
- Statistics of correlations in nonlinear recurrent neural networks
- The edge of chaos: quantum field theory and deep neural networks
- Solution of a chaotic neural network at fixed connectivity
The paper
Dynamics of random recurrent neural networks: colored noise and sublinear activations · Read on arXiv
Germán Mato, Facundo Rigatuso, Gonzalo Torroba
Instituto Balseiro, Universidad Nacional de Cuyo · Centro Atómico Bariloche and CONICET
We study the dynamics of recurrent neural networks with random couplings, sublinear odd activation functions, and temporally correlated noise. Using large N methods, we determine stationary correlations and distinguish the loss of local linear stability from the onset of chaos, characterized by a positive largest Lyapunov exponent. These thresholds delimit an intermediate regime in which local instability coexists with asymptotic stability under a common noise history. Their separation depends on both the noise correlation time and the asymptotic growth of the activation function. We show that internal noise with any finite correlation time cuts off the divergence of the network's intrinsic correlation time tau corr at the edge of chaos; it exhibits a critical scaling tau corr,max propto 1/sqrt D 0, where D 0 is the integrated noise strength. Static random input instead produces coincident thresholds and a divergent correlation time. We also calculate the frequency-dependent participation dimension from a four-point correlation function. Its zero-frequency value is inversely proportional to the fourth power of the network correlation time, predicting a smooth minimum at the weak-noise chaos threshold. Numerical simulations support the large-network predictions and reveal appreciable finite-size effects.
Transcript
Introduction to the show: ident: Genomics Radio. Generated commentary on the latest computational biology and genomics papers.
Ines: We're looking at the paper: "Dynamics of random recurrent neural networks".
Marcus: Here's the gist of the paper. The study determines stationary correlations and distinguishes between local linear stability and chaos in recurrent neural networks with random couplings, sublinear activations, and temporally correlated noise.
Ines: Model Description The model considers a network of N recurrently coupled units with continuous time and a firing-rate dynamics governed by the Langevin equation (2.1) The network contains two independent sources of randomness: the quenched W-disorder (2.2) and the dynamical internal noise ξi(t) (2.3).
Marcus: The internal noise is specifically modeled as an Ornstein–Uhlenbeck process, which introduces a tunable correlation time τn (2.4).
Ines: This allows the study to investigate how colored noise affects network correlations and the onset of chaos by varying τn.
Paper summary: Ines: So, we're talking about this paper, "Dynamics of random recurrent neural networks: colored noise and sublinear activations." Basically, they are looking at these recurrent neural networks with random couplings and these sublinear activation functions.
Marcus: And they’re adding this layer of complexity by including temporally correlated noise. The main goal is to figure out how this noise affects the network's behavior—specifically, whether it goes from being locally stable to becoming chaotic.
Yuki: From a population genetics perspective, I always wonder what kind of dynamics we are actually modeling here. Are we looking at something that mirrors evolutionary processes or something more about signal processing?
Ines: Yeah, the core thesis is determining the stationary correlations in these systems and drawing a line between local linear stability and chaos, which they characterize by finding a positive largest Lyapunov exponent. This helps define this intermediate regime where things are locally unstable but still asymptotically stable under a common noise history.
Marcus: What's really interesting about their findings is how the separation between that local instability threshold and the chaos threshold depends on two things: the noise correlation time and how fast the activation function grows.
Yuki: That dependence on the noise correlation time makes me think about real biological systems where inputs aren't just random spikes but have some temporal structure to them. Does this model capture anything relevant about how biological networks handle noisy, correlated signals?
Ines: It does, because they show that internal noise with any finite correlation time actually cuts off the divergence of the network’s intrinsic correlation time at the edge of chaos. They find a critical scaling for this maximum correlation time, tau corr,max, which is proportional to one/sqrt D zero where D zero is the integrated noise strength.
Marcus: That's a specific physical prediction there. Now, if you look at static random input instead of this colored noise, they get coincident thresholds and a divergent correlation time. They find that static random input just doesn't behave the same way because those two transitions merge into one point.
Yuki: So the difference between colored noise with finite correlation time and static randomness is that the system has a way to limit how long its memory can persist before it hits chaos, which is kind of a key distinction for understanding complex systems.
Ines: Exactly. And they also look at other things too, like the frequency-dependent participation dimension derived from a four-point correlation function. The zero-frequency value of that is inversely proportional to the fourth power of the network correlation time, predicting a smooth minimum right at that weak-noise chaos threshold.
Marcus: That gives us another way to probe the dynamics. If you measure that output dimension, it should show a clear dip where the noise is weak and things are about to become chaotic. This helps confirm the general picture derived from their large N methods, which they say are supported by numerical simulations for N=four thousand neurons.
Yuki: It’s interesting how they connect this mathematical structure back to what we see in the population level, because that participation dimension relates directly to how much of the network activity is contributing to the signal.
Ines: And they found that numerical simulations show appreciable finite-size effects, which is always a caution when you’re relying on large N predictions, even if N is quite big. The phase diagram they show has three regimes: local linear stability below lambda c1, local instability but with a negative largest Lyapunov exponent between lambda c1 and lambda c2, and then chaos above lambda c2.
Marcus: That intermediate regime, where you have local instability but no actual chaos, is important because it describes a state that's not immediately chaotic yet, just poised on the edge. The separation between those two thresholds is controlled by the activation function's growth and the noise correlation time.
Yuki: So if we were looking at evolution, this suggests there could be periods where a population stays in this locally unstable but stable state for a long time before transitioning into full chaotic behavior. It adds a layer of temporal structure to our models.
Ines: The paper concludes that the temporal structure of the noise and the form of the activation function jointly control whether local instability develops into chaos. They emphasize that correlation time is an important observable characterizing network dynamics, especially near chaos, revealing universal scaling properties related to noise strength.
Marcus: So, when you take this whole idea—how colored noise limits memory at the edge of chaos—it suggests that the way a system "remembers" its past can be tuned by how noisy and correlated the input is.
Yuki: It’s like looking at a population and realizing that the temporal structure of environmental factors dictates whether that group stays in a predictable pattern or starts exhibiting unpredictable fluctuations. That's what this work points toward.
Conclusion: Ines: So we’re wrapping up this look at these recurrent neural networks with random couplings and that sublinear activation function, focusing on how colored noise messes with their behavior and whether they turn chaotic or stay stable.
Marcus: Yeah, the authors are looking at stationary correlations in these systems using large N methods to find those stability boundaries. It boils down to finding the point where local linear stability gives way to chaos characterized by a positive largest Lyapunov exponent.
Yuki: From a population genetics angle, I see this as looking at how noise structure—the correlation time of the internal noise—determines if a genetic system settles into a stable state or starts exploring chaotic dynamics.
Ines: Exactly. The main thing they show is that colored noise with any finite correlation time actually cuts off the divergence of the intrinsic correlation time right at the edge of chaos, showing this scaling where tau corr,max is proportional to one over the square root of D zero.
Marcus: That’s a key result because static random input doesn't show that same behavior; it just gives you coincident thresholds and a divergent correlation time instead. So having that finite noise correlation time matters for the network's memory structure.
Yuki: What this means for us is that if we have noisy environmental inputs, the way they are correlated—whether white or colored noise—matters a lot in determining if the network remains predictable or becomes unpredictable over time.
Ines: Right, and they also looked at how this relates to output dimensions. The zero-frequency participation dimension scales inversely with the fourth power of that correlation time near chaos, predicting a minimum right at that weak-noise threshold.
Marcus: So basically, they’re saying the temporal structure of the noise and how fast your activation function grows jointly decide if local instability turns into full chaos. It’s a delicate balance between those two things.
Yuki: It suggests that for real systems, not just the presence of noise matters, but how temporally structured that noise is to predict long-term stability or complexity in a population.
More episodes
- 2610.31454-Benchmarking Recent Single-Cell Synthetic Data Generation Methods on the OneK1K Dataset
- 2610.30808-Global Convergence of Detailed Balanced Mass Action Systems
- 2610.30855-From Turing Patterns to Spike Self-Replication and Nucleation in a Growing-Domain Tulip Breaking Virus Model
- 2610.30287-Non-Destructive Detection of Early Drought Stress via Spectral Submanifold Analysis
- 2610.30588-Supercoiling Drives DNA-Protein Co-Condensation
- 2610.30431-Modelling Toxin-Induced Intraspecific Personality Variation in Predator-Prey Dynamics
- 2610.30776-Report the tolerance, not the count: exact phylogenetic distance deconvolution with incomplete references
- 2610.31154-Generalized modeling reveals stabilizing mechanisms in cross-feeding microbial communities
- 2610.30217-The medium is the message: How neurometabolic entanglement generates conscious experience
- 2610.30364-Gate-Based Feature Importance in Simulation-Based Inference for EEG: A Cautionary Tale