Papers › Emergent mechanisms for long timescales depend on training curriculum and affect...

Emergent mechanisms for long timescales depend on training curriculum and affect performance in memory tasks

22 Sep 2023arXiv:2309.12927archive 2025-07-28

Sina Khajehabdollahi, Roxana Zeraati, Emmanouil Giannakakis, Tim Jakob Schäfer, Georg Martius, Anna Levina

Recurrent neural networks (RNNs) in the brain and in silico excel at solving tasks with intricate temporal dependencies. Long timescales required for solving such tasks can arise from properties of individual neurons (single-neuron timescale, τ, e.g., membrane time constant in biological neurons) or recurrent interactions among them (network-mediated timescale). However, the contribution of each mechanism for optimally solving memory-dependent tasks remains poorly understood. Here, we train RNNs to solve N-parity and N-delayed match-to-sample tasks with increasing memory requirements controlled by N by simultaneously optimizing recurrent weights and τs. We find that for both tasks RNNs develop longer timescales with increasing N, but depending on the learning objective, they use different mechanisms. Two distinct curricula define learning objectives: sequential learning of a single-N (single-head) or simultaneous learning of multiple $N$s (multi-head). Single-head networks increase their τ with N and are able to solve tasks for large N, but they suffer from catastrophic forgetting. However, multi-head networks, which are explicitly required to hold multiple concurrent memories, keep τ constant and develop longer timescales through recurrent connectivity. Moreover, we show that the multi-head curriculum increases training speed and network stability to ablations and perturbations, and allows RNNs to generalize better to tasks beyond their training regime. This curriculum also significantly improves training GRUs and LSTMs for large-N tasks. Our results suggest that adapting timescales to task requirements via recurrent interactions allows learning more complex objectives and improves the RNN's performance.

PaperPDFCodeCode Syntology ran

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="2309.12927")

Code

Syntology Ran 11 of 14 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 11 ran with no contract checked.

By repository: official repository: 14 samples from 1 repository, 11 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

LevinaLab/rnn_timescale_public officialmentioned in paperpytorch report

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

14 samples harvested; 11 ran; 0 honoured the contract we drafted; 3 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.

11ran
3unverified

Licence: 14 of the 14 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 LevinaLab/rnn_timescale_public. “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.

generate_binary_sequence LevinaLab/rnn_timescale_public/analysis/network_dynamics/dynamics_utils.py official repository ran fingerprinted no licence file found · pointer only · 4c2c05c8c83f2a32 · report
generate_binary_sequence LevinaLab/rnn_timescale_public/src/lstm_utils/lstm_utils.py official repository ran fingerprinted no licence file found · pointer only · 068415a58c09c578 · report
generate_binary_sequence LevinaLab/rnn_timescale_public/src/tasks/tasks.py official repository ran no licence file found · pointer only · b44b4cb397effb0b · report
generate_sparse_binary_sequence LevinaLab/rnn_timescale_public/src/tasks/tasks.py official repository ran fingerprinted no licence file found · pointer only · 77b2f189f38f0af9 · report
get_parity LevinaLab/rnn_timescale_public/src/tasks/tasks.py official repository ran no licence file found · pointer only · bdf3fbb3bf75870e · report
init_model LevinaLab/rnn_timescale_public/src/models/RNN_Stack.py official repository ran no licence file found · pointer only · 0fd1ea970f48ee3e · report
init_model_mod LevinaLab/rnn_timescale_public/src/models/RNN_modified.py official repository ran no licence file found · pointer only · cdf2e9a94fc6694f · report
make_batch_Nbit_parity LevinaLab/rnn_timescale_public/analysis/network_dynamics/dynamics_utils.py official repository ran fingerprinted no licence file found · pointer only · 0aa7c2f056622901 · report
make_binary_data LevinaLab/rnn_timescale_public/analysis/network_dynamics/dynamics_utils.py official repository ran no licence file found · pointer only · 415700c9472ca684 · report
perturb_network_ LevinaLab/rnn_timescale_public/src/utils/accuracy_perturbation_ablation.py official repository ran no licence file found · pointer only · be2d6d3e05db770a · report
simulate_lstm_binary LevinaLab/rnn_timescale_public/src/lstm_utils/lstm_utils.py official repository ran no licence file found · pointer only · fdf53bfaec7075bc · report
calculate_accuracy_ LevinaLab/rnn_timescale_public/src/utils/accuracy_perturbation_ablation.py official repository unverified no licence file found · pointer only · 14a6c5482c65de54 · report
init_model_continuous LevinaLab/rnn_timescale_public/src/models/RNN_Continuous.py official repository unverified no licence file found · pointer only · 5568b1823350da1f · report
load_lstm LevinaLab/rnn_timescale_public/src/lstm_utils/lstm_utils.py official repository unverified no licence file found · pointer only · dca99733daa24cb7 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

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