On Scrambling Phenomena for Randomly Initialized Recurrent Networks
Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios, Andrew Stavroulakis

TL;DR
This paper establishes that randomly initialized RNNs inherently exhibit Li-Yorke chaos with constant probability, explaining the scrambling phenomena and their robustness, which impacts training and expressive power.
Contribution
It proves that standard initialization causes RNNs to exhibit chaos independently of width, linking RNN dynamics to chaotic systems and explaining scrambling behavior.
Findings
RNNs exhibit Li-Yorke chaos with constant probability
Chaotic behavior persists under small perturbations
Expressive power remains exponential in feedback iterations
Abstract
Recurrent Neural Networks (RNNs) frequently exhibit complicated dynamics, and their sensitivity to the initialization process often renders them notoriously hard to train. Recent works have shed light on such phenomena analyzing when exploding or vanishing gradients may occur, either of which is detrimental for training dynamics. In this paper, we point to a formal connection between RNNs and chaotic dynamical systems and prove a qualitatively stronger phenomenon about RNNs than what exploding gradients seem to suggest. Our main result proves that under standard initialization (e.g., He, Xavier etc.), RNNs will exhibit \textit{Li-Yorke chaos} with \textit{constant} probability \textit{independent} of the network's width. This explains the experimentally observed phenomenon of \textit{scrambling}, under which trajectories of nearby points may appear to be arbitrarily close during some…
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.
Code & Models
Videos
Taxonomy
TopicsNeural Networks and Applications · Model Reduction and Neural Networks · Statistical Mechanics and Entropy
