The computational and learning benefits of Daleian neural networks
Adam Haber, Elad Schneidman
Abstract
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
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 903b9cdf-dc75-4b79-8f1c-47bf7db9fe45Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Learning better with Dale's Law: A Spectral PerspectivePingsheng Li, Jonathan Cornford, Arna Ghosh, Blake A. RichardsNeurIPS 2023 · 18 citations
- Minimax Dynamics of Optimally Balanced Spiking Networks of Excitatory and Inhibitory NeuronsQianyi Li, Cengiz PehlevanNeurIPS 2020 · 8 citations
- A mechanistic multi-area recurrent network model of decision-makingMichael Kleinman, Chandramouli Chandrasekaran, Jonathan C. KaoNeurIPS 2021 · 19 citations
- 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
