Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural Networks
Not on the map. Why?
Abstract (arXiv)
Task-trained recurrent neural networks (RNNs) are widely used in neuroscience and machine learning to model dynamical computations. To gain mechanistic insight into how neural systems solve tasks, prior work often reverse-engineers individual trained networks. However, different RNNs trained on the same task and achieving similar performance can exhibit strikingly different internal solutions, a phenomenon known as solution degeneracy. Here, we develop a unified framework to systematically quantify and control solution degeneracy across three levels: behavior, neural dynamics, and weight space. We apply this framework to 3,400 RNNs trained on four neuroscience-relevant tasks: flip-flop memory, sine wave generation, delayed discrimination, and path integration, while systematically varying task complexity, learning regime, network size, and regularization. We find that higher task complexity and stronger feature learning reduce degeneracy in neural dynamics but increase it in weight space, with mixed effects on behavior. In contrast, larger networks and structural regularization reduce degeneracy at all three levels. These findings empirically validate the Contravariance Principle and provide practical guidance for researchers seeking to tune the variability of RNN solutions, either to uncover shared neural mechanisms or to model the individual variability observed in biological systems. This work provides a principled framework for quantifying and controlling solution degeneracy in task-trained RNNs, offering new tools for building more interpretable and biologically grounded models of neural computation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 108 references that are in the map. First posted on arXiv 4 Oct 2024.
Builds on
49 of 108 references.
References · 49
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2024The Platonic Representation Hypothesiscited by 382
37 more
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 324
- 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 288
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
- 2016Deep Learning without Poor Local Minimacited by 234
- 2015Convergent Learning: Do different neural networks learn the same representations?cited by 220
- 2021Revisiting Model Stitching to Compare Neural Representationscited by 209
- 2021Accounting for Variance in Machine Learning Benchmarkscited by 201
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2018Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networkscited by 141
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 127
- 2021Generalized Shape Metrics on Neural Representationscited by 112
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
- 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
- 2023Tensor Programs VI: Feature Learning in Infinite-Depth Neural Networkscited by 97
- 2017The loss surface of deep and wide neural networkscited by 74
- 2019Large Scale Structure of Neural Network Loss Landscapescited by 68
- 2019Universality and individuality in neural dynamics across large populations of recurrent networkscited by 61
- 2017Linking connectivity, dynamics and computations in low-rank recurrent neural networkscited by 51
- 2019Unsupervised Model Selection for Variational Disentangled Representation Learningcited by 46
- 2023Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networkscited by 43
- 2019Where is the Information in a Deep Neural Network?cited by 42
- 2016Capacity and Trainability in Recurrent Neural Networkscited by 28
- 2023Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits with Dynamical Similarity Analysiscited by 23
- 2016Recurrent Network Models Of Sequence Generation And Memorycited by 21
- 2023Expand-and-Cluster: Parameter Recovery of Neural Networkscited by 15
- 2023How connectivity structure shapes rich and lazy learning in neural circuitscited by 15
- 2021Does the Data Induce Capacity Control in Deep Learning?cited by 14
- 2020Shaping dynamics with multiple populations in low-rank recurrent networkscited by 10
- 2022Winning the lottery with neural connectivity constraints: faster learning across cognitive tasks with spatially constrained sparse RNNscited by 10
- 2021Charting and navigating the space of solutions for recurrent neural networkscited by 8
- 2022Lazy vs hasty: linearization in deep networks impacts learning schedule based on example difficultycited by 5
- 2023ContraSim -- Analyzing Neural Representations Based on Contrastive Learningcited by 4
- 2020Exploring Flip Flop memories and beyond: training recurrent neural networks with key insightscited by 2
- 2023Phase codes emerge in recurrent neural networks optimized for modular arithmeticcited by 2
Built on by
Not cited yet.