Pith

open record

sign in
Browse

arxiv: 2106.02626 · v6 · pith:YGXJA6K5 · submitted 2021-06-04 · q-bio.NC · cs.AI· cs.LG· cs.NE

Dynamics of specialization in neural modules under resource constraints

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:YGXJA6K5record.jsonopen to challenge →

classification q-bio.NC cs.AIcs.LGcs.NE
keywords specializationnetworkmodularityenvironmentfunctionalacrossdependdynamics
0
0 comments X
read the original abstract

It has long been believed that the brain is highly modular both in terms of structure and function, although recent evidence has led some to question the extent of both types of modularity. We used artificial neural networks to test the hypothesis that structural modularity is sufficient to guarantee functional specialization, and find that in general, this doesn't necessarily hold. We then systematically tested which features of the environment and network do lead to the emergence of specialization. We used a simple toy environment, task and network, allowing us precise control, and show that in this setup, several distinct measures of specialization give qualitatively similar results. We further find that in this setup (1) specialization can only emerge in environments where features of that environment are meaningfully separable, (2) specialization preferentially emerges when the network is strongly resource-constrained, and (3) these findings are qualitatively similar across the different variations of network architectures that we tested, but that the quantitative relationships depend on the precise architecture. Finally, we show that functional specialization varies dynamically across time, and demonstrate that these dynamics depend on both the timing and bandwidth of information flow in the network. We conclude that a static notion of specialization, based on structural modularity, is likely too simple a framework for understanding intelligence in situations of real-world complexity, from biology to brain-inspired neuromorphic systems. We propose that thoroughly stress testing candidate definitions of functional modularity in simplified scenarios before extending to more complex data, network models and electrophysiological recordings is likely to be a fruitful approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks

    cs.NE 2026-05 unverdicted novelty 7.0

    Multi-hop graph analysis of RNNs reveals temporal information routing and motivates resolvent regularization that outperforms L1 by enforcing pathway-level sparsity aligned with task structure.

  2. Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks

    cs.NE 2026-05 unverdicted novelty 7.0

    RNN computation is recovered from multi-hop graph pathways, and constraining these pathways via resolvent regularization yields improved temporal sparsity and task performance over standard L1.