Modular Growth of Hierarchical Networks: Efficient, General, and Robust Curriculum Learning
Not on the map. Why?
Abstract (arXiv)
Structural modularity is a pervasive feature of biological neural networks, which have been linked to several functional and computational advantages. Yet, the use of modular architectures in artificial neural networks has been relatively limited despite early successes. Here, we explore the performance and functional dynamics of a modular network trained on a memory task via an iterative growth curriculum. We find that for a given classical, non-modular recurrent neural network (RNN), an equivalent modular network will perform better across multiple metrics, including training time, generalizability, and robustness to some perturbations. We further examine how different aspects of a modular network's connectivity contribute to its computational capability. We then demonstrate that the inductive bias introduced by the modular topology is strong enough for the network to perform well even when the connectivity within modules is fixed and only the connections between modules are trained. Our findings suggest that gradual modular growth of RNNs could provide advantages for learning increasingly complex tasks on evolutionary timescales, and help build more scalable and compressible artificial networks.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 67 references that are in the map. First posted on arXiv 10 Jun 2024.
Builds on
21 of 67 references.
References · 21
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2016HyperNetworkscited by 1,003
- 2022Simplified State Space Layers for Sequence Modelingcited by 776
- 2013Speech Recognition with Deep Recurrent Neural Networkscited by 666
- 2020Incorporating Learnable Membrane Time Constant to Enhance Learning of Spiking Neural Networkscited by 340
- 2024Evolutionary Optimization of Model Merging Recipescited by 204
- 2019Weight Agnostic Neural Networkscited by 71
- 2019Superposition of many models into onecited by 64
- 2018Can recurrent neural networks warp time?cited by 53
- 2020Effective and Efficient Computation with Multiple-timescale Spiking Recurrent Neural Networkscited by 43
- 2023On Efficient Training of Large-Scale Deep Learning Models: A Literature Reviewcited by 26
9 more
- 2019A Review of Modularization Techniques in Artificial Neural Networkscited by 19
- 2023Towards Self-Assembling Artificial Neural Networks through Neural Developmental Programscited by 17
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptationcited by 8
- 2023Emergent mechanisms for long timescales depend on training curriculum and affect performance in memory taskscited by 6
- 2024Harmonizing Program Induction with Rate-Distortion Theorycited by 4
- 2022Spatial and temporal correlations in neural networks with structured connectivitycited by 2
- 2015Emergence of slow-switching assemblies in structured neuronal networkscited by 1
- 2019Tailored ensembles of neural networks optimize sensitivity to stimulus statisticscited by 1
- 2023When to be critical? Performance and evolvability in different regimes of neural Ising agentscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.