mlsanityData to 14 Oct 2026

Do Artificial Neural Networks Need Dendritic Nanotubes? Two Reasons for Shrinking Importance Estimates in Continual Learning

arXiv 2610.14258 ↗First posted 9 Oct 2026cs.LG cs.NEcited by 0

Not on the map. Why?

Abstract (arXiv)

Regularization-based continual learning protects each parameter in proportion to an estimate of its importance, yet these estimates come from finite samples and heuristics and are used as if they were exact. We report four studies that start from a biologically inspired mechanism and end with a statistical explanation of it. Motivated by dendritic nanotubes, we let transient lateral links diffuse importance tags between hidden units. Links between co-active units gave no significant gain, but random links with lifetimes of 25 or 200 steps raised final accuracy on 20-task Permuted MNIST by 1.5 to 2.6 points. We show that random diffusion implements linear shrinkage of importance toward the layer mean in expectation. A simulation of the link process alone predicts shrinkage weights of 0.23 and 0.52 for these lifetimes, and graph-free shrinkage at 0.25 and 0.5 reproduces both the accuracy and the dispersion of the consolidated importance, while every activity-dependent rule did worse than random links. A five-seed screen across EWC, SI, and MAS found nominal gains for SI and MAS on Permuted MNIST and losses on task-incremental Split CIFAR-100, where forgetting was small and shrinkage cost plasticity. Varying the number of importance samples then separates two mechanisms on Permuted MNIST. For EWC, the gain fell by about ten points per tenfold increase in samples, from 19.6 points with 10 samples to -0.4 with 1000, a variance effect. For MAS, a gain of about one point persisted at 1000 samples, consistent with a bias in the importance measure rather than noise. Shrinkage had no detectable effect for MAS on a domain-incremental CIFAR-100 benchmark. Finally, we show that a standard heteroscedastic empirical Bayes rule shrinks the largest Fisher-type estimates most, which may explain its poor results, and point to a log-scale alternative.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 42 references that are in the map. First posted on arXiv 9 Oct 2026.

Builds on

22 of 42 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  4. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  5. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  6. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  7. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
  8. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  9. 2018Progress & Compress: A scalable framework for continual learningcited by 520
  10. 2014New insights and perspectives on the natural gradient methodcited by 443
  11. 2017Variational Continual Learningcited by 339
  12. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
10 more
  1. 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 201
  2. 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 146
  3. 2020Continual Learning with Node-Importance based Adaptive Group Sparse Regularizationcited by 105
  4. 2019Uncertainty-guided Continual Learning with Bayesian Neural Networkscited by 102
  5. 2017On Quadratic Penalties in Elastic Weight Consolidationcited by 55
  6. 2018Continual Reinforcement Learning with Complex Synapsescited by 32
  7. 2021Synaptic metaplasticity in binarized neural networkscited by 29
  8. 2025On the Computation of the Fisher Information in Continual Learningcited by 13
  9. 2025Bayesian continual learning and forgetting in neural networkscited by 9
  10. 2026Affect and Effect: Limitations of regularisation-based continual learning in EEG-based emotion classificationcited by 1

Built on by

Not cited yet.