arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.04033q-bio.NCcs.LG
收藏

连接体约束神经网络中的拓扑灵敏度

Topological Sensitivity in Connectome-Constrained Neural Networks

Nalin Dhiman

AI总结:

研究通过飞蝇连接体实验验证连接体拓扑对神经网络学习效率的影响,发现连接体在弱控制下表现更优,但在严格控制下优势消失,揭示初始化和空模型混淆因素的影响。

摘要:

连接体约束神经网络通常通过稀疏随机控制进行评估,并被解释为生物图拓扑能提高学习效率。本文通过飞蝇连接体、朴素自环匹配随机图和度数保持重排空模型的受控研究,发现弱控制下连接体在早期损失、平均活动和运行时间上表现更优。但在严格控制下,从共享随机初始化训练消除了早期损失优势,用度数保持空模型替代朴素空模型消除了活动优势。五样本度数保持集合和预训练活动尺度诊断进一步支持了这一修订解释。还报告了早期弱控制比较的描述性机制分析,但将其视为行为特征而非因果优越性的证明。研究显示,之前报告的连接体约束神经网络拓扑优势可能源于初始化和空模型混淆因素,在公平的从头初始化和度数保持控制下基本消失。

英文摘要:

Connectome-constrained neural networks are often evaluated against sparse random controls and then interpreted as evidence that biological graph topology improves learning efficiency. We revisit that claim in a controlled flyvis-based study using a Drosophila connectome, a naive self-loop-matched random graph, and a degree-preserving rewired null. Under weak controls, in which both models were recovered from a connectome-trained checkpoint and the null matched only global graph counts, the connectome appeared substantially better in early loss, mean activity, and runtime. That picture changed under stricter controls. Training both graphs from a shared random initialization removed the early loss advantage, and replacing the naive null by a degree-preserving null removed the apparent activity advantage. A five-sample degree-preserving ensemble and a pre-training activity-scale diagnostic further strengthened this revised interpretation. We also report a descriptive mechanism analysis of the earlier weak-control comparison, but we treat it as behavioral characterization rather than proof of causal superiority. We show that previously reported topology advantages in connectome-constrained neural networks can arise from initialization and null-model confounds, and largely disappear under fair from-scratch initialization and degree-preserving controls.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑