Emergent mechanisms for long timescales depend on training curriculum and affect performance in memory tasks
Sina Khajehabdollahi, Roxana Zeraati, Emmanouil Giannakakis, Tim Jakob Schäfer, Georg Martius, Anna Levina
Abstract
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 -parity and -delayed match-to-sample tasks with increasing memory requirements controlled by by simultaneously optimizing recurrent weights and s. We find that for both tasks RNNs develop longer timescales with increasing , but depending on the learning objective, they use different mechanisms. Two distinct curricula define learning objectives: sequential learning of a single- (single-head) or simultaneous learning of multiple s (multi-head). Single-head networks increase their with and are able to solve tasks for large , 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- tasks. Our results suggest that adapting timescales to task requirements via recurrent interactions allows learning more complex objectives and improves the RNN's performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cf35dd03-fd54-4e73-8519-49a67910d48dCited by top-tier papers1
Ask how each one uses itBuilds on6
- Adversarial Weight Perturbation Helps Robust GeneralizationDongxian Wu, Shu-Tao Xia, Yisen WangNeurIPS 2020 · 917 citations
- Incorporating Learnable Membrane Time Constant to Enhance Learning of Spiking Neural NetworksWei Fang, Zhaofei Yu, Yanqi Chen, Timothée Masquelier et al.ICCV 2021 · 731 citations
- Simplified State Space Layers for Sequence ModelingJimmy T. H. Smith, Andrew Warrington, Scott W. LindermanICLR 2023 · 78 citations
- Interpretable multi-timescale models for predicting fMRI responses to continuous natural speechShailee Jain, Vy A. Vo, Shivangi Mahto, Amanda LeBel et al.NeurIPS 2020 · 58 citations
- Multi-timescale Representation Learning in LSTM Language ModelsShivangi Mahto, Vy Ai Vo, Javier S. Turek, Alexander HuthICLR 2021 · 33 citations
Related papers
- Training biologically plausible recurrent neural networks on cognitive tasks with long-term dependenciesWayne Soo, Vishwa Goudar, Xiao-Jing WangNeurIPS 2023 · 16 citations
- DeepSITH: Efficient Learning via Decomposition of What and When Across Time ScalesBrandon G. Jacques, Zoran Tiganj, Marc W. Howard, Per B. SederbergNeurIPS 2021 · 9 citations
- Operative dimensions in unconstrained connectivity of recurrent neural networksRenate Krause, Matthew Cook, Sepp Kollmorgen, Valerio Mante et al.NeurIPS 2022 · 12 citations
- Curriculum learning as a tool to uncover learning principles in the brainDaniel R. Kepple, Rainer Engelken, Kanaka RajanICLR 2022 · 21 citations
- On the Curse of Memory in Recurrent Neural Networks: Approximation and Optimization AnalysisZhong Li, Jiequn Han, Weinan E, Qianxiao LiICLR 2021 · 40 citations
