The computational and learning benefits of Daleian neural networks
Adam Haber, Elad Schneidman
摘要
Dale's principle implies that biological neural networks are composed of neurons that are either excitatory or inhibitory. While the number of possible architectures of such Daleian networks is exponentially smaller than non-Daleian ones, the computational and functional implications of using Daleian networks by the brain are mostly unknown. Here, we use models of recurrent spiking neural networks and rate-based networks to show, surprisingly, that despite the structural limitations on Daleian networks, they can approximate the computation performed by non-Daleian networks to a very high degree of accuracy. Moreover, we find that Daleian networks are more functionally robust to synaptic noise. We then show that unlike non-Daleian networks, Daleian ones can learn efficiently by tuning single neuron features, nearly as well as learning by tuning individual synaptic weights - suggesting a simpler and more biologically plausible learning mechanism. We thus suggest that in addition to architectural simplicity, Dale's principle confers computational and learning benefits for biological networks, and offers new directions for constructing and training biologically-inspired artificial neural networks
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- Learning better with Dale's Law: A Spectral PerspectivePingsheng Li, Jonathan Cornford, Arna Ghosh, Blake A. RichardsNeurIPS 2023 · 被引用 18 次
- Minimax Dynamics of Optimally Balanced Spiking Networks of Excitatory and Inhibitory NeuronsQianyi Li, Cengiz PehlevanNeurIPS 2020 · 被引用 8 次
- A mechanistic multi-area recurrent network model of decision-makingMichael Kleinman, Chandramouli Chandrasekaran, Jonathan C. KaoNeurIPS 2021 · 被引用 19 次
- Biologically plausible heavy-tailed connectivity enhances generalizations on cognitive tasks in recurrent neural networksZhe Jiao, Xiaodong He, Shanglin ZhouICML 2026
- Bounds on the computational complexity of neurons due to dendritic morphologyAnamika Agrawal, Michael A. BuiceNeurIPS 2025
