Bounds on the computational complexity of neurons due to dendritic morphology
Anamika Agrawal, Michael A. Buice
Abstract
The simple linear threshold units used in many artificial neural networks have a limited computational capacity. Famously, a single unit cannot handle nonlinearly separable problems like XOR. In contrast, real neurons exhibit complex morphologies as well as active dendritic integration, suggesting that their computational capacities outperform those of simple linear units. Considering specific families of Boolean functions, we empirically examine the computational limits of single units that incorporate more complex dendritic structures. For random Boolean functions, we show that there is a phase transition in learnability as a function of the input dimension, with most random functions below a certain critical dimension being learnable and those above not. This critical dimension is best predicted by the overall size of the dendritic arbor. This demonstrates that real neurons have a far higher computational complexity than is usually considered in neural models, whether in machine learning or computational neuroscience. Furthermore, using architectures that are, respectively, more "apical" or "basal" we show that there are non-trivially disjoint sets of learnable functions by each type of neuron. Importantly, these two types of architectures differ in the robustness and generality of the computations they can perform. The basal-like architecture shows a higher probability of function realization, while the apical-like architecture shows an advantage with fast retraining for different functions. Given the cell-type specificity of morphological characteristics, these results suggest both that different components of the dendritic arbor as well as distinct cell types may have distinct computational roles. In single neurons, morphology sculpts computation, shaping not only what neurons do, but how they learn and adapt. Our analysis offers new directions for neuron-level inductive biases in NeuroAI models using scalable models for neuronal cell-type specific computation.
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 5a2710dd-70ec-4517-8945-267cd5656a5fRelated papers
- The computational and learning benefits of Daleian neural networksAdam Haber, Elad SchneidmanNeurIPS 2022 · 10 citations
- MorphVAE: Generating Neural Morphologies from 3D-Walks using a Variational Autoencoder with Spherical Latent SpaceSophie Laturnus, Philipp BerensICML 2021 · 19 citations
- Logical Activation Functions: Logit-space equivalents of Probabilistic Boolean OperatorsScott C. Lowe, Robert Earle, Jason d'Eon, Thomas Trappenberg et al.NeurIPS 2022 · 2 citations
- Beyond Linear Processing: Dendritic Bilinear Integration in Spiking Neural NetworksJingyang Ma, Chongming Liu, Songting Li, Douglas ZhouICLR 2026
- Memorization Capacity of Neural Networks with Conditional ComputationErdem KoyuncuICLR 2023
