Charting and Navigating the Space of Solutions for Recurrent Neural Networks
Elia Turner, Kabir V. Dabholkar, Omri Barak
摘要
In recent years Recurrent Neural Networks (RNNs) were successfully used to model the way neural activity drives task-related behavior in animals, operating under the implicit assumption that the obtained solutions are universal. Observations in both neuroscience and machine learning challenge this assumption. Animals can approach a given task with a variety of strategies, and training machine learning algorithms introduces the phenomenon of underspecification. These observations imply that every task is associated with a space of solutions. To date, the structure of this space is not understood, limiting the approach of comparing RNNs with neural data. Here, we characterize the space of solutions associated with various tasks. We first study a simple two-neuron network on a task that leads to multiple solutions. We trace the nature of the final solution back to the network's initial connectivity and identify discrete dynamical regimes that underlie this diversity. We then examine three neuroscience-inspired tasks: Delayed discrimination, Interval discrimination, and Time reproduction. For each task, we find a rich set of solutions. One layer of variability can be found directly in the neural activity of the networks. An additional layer is uncovered by testing the trained networks' ability to extrapolate, as a perturbation to a system often reveals hidden structure. Furthermore, we relate extrapolation patterns to specific dynamical objects and effective algorithms found by the networks. We introduce a tool to derive the reduced dynamics of networks by generating a compact directed graph describing the essence of the dynamics with regards to behavioral inputs and outputs. Using this representation, we can partition the solutions to each task into a handful of types and show that neural features can partially predict them. Taken together, our results shed light on the concept of the space of solutions and its uses both in Machine learning and in Neuroscience.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper11
- Extracting computational mechanisms from neural data using low-rank RNNsAdrian Valente, Jonathan W. Pillow, Srdjan OstojicNeurIPS 2022 · 被引用 71 次
- Bifurcations and loss jumps in RNN trainingLukas Eisenmann, Zahra Monfared, Niclas Alexander Göring, Daniel DurstewitzNeurIPS 2023 · 被引用 29 次
- The Simplicity Bias in Multi-Task RNNs: Shared Attractors, Reuse of Dynamics, and Geometric RepresentationElia Turner, Omri BarakNeurIPS 2023 · 被引用 25 次
- Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural NetworksAnn Huang, Satpreet Harcharan Singh, Flavio Martinelli, Kanaka RajanNeurIPS 2025 · 被引用 22 次
- Beyond accuracy: generalization properties of bio-plausible temporal credit assignment rulesYuhan Helena Liu, Arna Ghosh, Blake A. Richards, Eric Shea-Brown 等NeurIPS 2022 · 被引用 10 次
它引用的顶会 Paper1
相关 Paper
- On Logical Extrapolation for Mazes with Recurrent and Implicit NetworksBrandon Knutson, Amandin Chyba Rabeendran, Michael I. Ivanitskiy, Jordan Pettyjohn 等AAAI 2026 · 被引用 7 次
- Temporal superposition and feature geometry of RNNs under memory demandsPratyaksh Sharma, Alexandra Maria Proca, Lucas Prieto, Pedro A. M. MedianoICLR 2026
- Discovering alternative solutions beyond the simplicity bias in recurrent neural networksWilliam Qian, Cengiz PehlevanICLR 2026 · 被引用 5 次
- Reverse-engineering recurrent neural network solutions to a hierarchical inference task for miceRylan Schaeffer, Mikail Khona, Leenoy Meshulam, International Brain Laboratory 等NeurIPS 2020 · 被引用 49 次
- Operative dimensions in unconstrained connectivity of recurrent neural networksRenate Krause, Matthew Cook, Sepp Kollmorgen, Valerio Mante 等NeurIPS 2022 · 被引用 12 次
