Papers › Charting and navigating the space of solutions for recurrent neural networks
Charting and navigating the space of solutions for recurrent neural networks
Elia Turner, Kabir Dabholkar, Omri Barak
Recurrent Neural Networks (RNNs) were recently 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 and interval discrimination, and Time reproduction. For each task, we find a rich set of solutions. Variability can be found directly in the neural activity of the networks, and additionally 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 partially predict them from neural features. Our results shed light on the concept of the space of solutions and its uses in Machine learning and in Neuroscience.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2111.09356")
Code
Syntology Ran 21 of 46 code samples harvested from 1 repository linked to this paper; 25 have no recorded run. Of those that ran: 8 ran · honoured contract; 4 ran · violated contract; 6 ran · our draft was wrong; 1 ran · fixture could not drive it; 2 ran with no contract checked.
By repository: official repository: 46 samples from 1 repository, 21 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
46 samples harvested; 21 ran; 8 honoured the contract we drafted; 25 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 46 of the 46 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from eliaturner/space-of-solutions-rnn. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
faccc1c689a2ed0e · report
25dff3a0ce8e52c6 · report
aec9430f7428319d · report
b2b0352f37d9319d · report
caaa11a04fbc5814 · report
df12b0b8f73f171f · report
001ff5f383a4130c · report
615bb1ff169f4a10 · report
62d98cd9762d8b0c · report
93f7c97198955ef7 · report
96a5aa0968aad06b · report
f9445822175bc7b9 · report
93cc45cabb504e93 · report
73b031ebc624843d · report
a4d852cc0fe10648 · report
76e2a3048ddb706e · report
732dcfc3729281c6 · report
b62a3520a7e372d0 · report
80645396bf42b8e6 · report
c005caf129e972e0 · report
5c8ef092b4630ff8 · report
da28a85f859ed730 · report
4f2ff1b68a2d77a9 · report
45c3a4640f99a73a · report
0a38342bb02c942f · report
acbe66815fb07933 · report
27a61359fe068a73 · report
ba8644dc8e550e55 · report
23d8262dc927f1eb · report
28285443ad039dbd · report
595eb81aacd577ec · report
8cdf4e586d5d62e7 · report
a21a4d05dd51c431 · report
40e93d32b8f92389 · report
82a7792ae91bb0d1 · report
65f3109a43521871 · report
457ecfefaa97e3bb · report
35768b563789ac19 · report
d9e98cf7dab8b4c8 · report
d2126a6a6bab8b28 · report
f036f25b71b02505 · report
93523148bf1dd544 · report
58516f1e4a6763b1 · report
02127c61512197da · report
774f3a2dbcc9fdf3 · report
1b7b69f6648f93d1 · report
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections