Cannistraci-Hebb Training on Ultra-Sparse Spiking Neural Networks
Yuan Hua, Jilin Zhang, Yingtao Zhang, Wenqi Gu, Leyi You, Baobo Xiong, Carlo Vittorio Cannistraci, Hong Chen

TL;DR
This paper introduces CH-SNN, a dynamic sparse training framework for spiking neural networks that maintains high performance at ultra-sparse levels, inspired by brain-like learning mechanisms.
Contribution
It proposes a novel four-stage sparse training method incorporating topological initialization, weight sparsity, pruning, and link prediction based on Cannistraci-Hebb theory.
Findings
Achieves ultra-sparse SNNs with minimal performance loss
Demonstrates effectiveness across multiple datasets and architectures
Enables energy-efficient neuromorphic computing applications
Abstract
Inspired by the brain's spike-based computation, spiking neural networks (SNNs) inherently possess temporal activation sparsity. However, when it comes to the sparse training of SNNs in the structural connection domain, existing methods fail to achieve ultra-sparse network structures without significant performance loss, thereby hindering progress in energy-efficient neuromorphic computing. This limitation presents a critical challenge: how to achieve high levels of structural connection sparsity while maintaining performance comparable to fully connected networks. To address this challenge, we propose the Cannistraci-Hebb Spiking Neural Network (CH-SNN), a novel and generalizable dynamic sparse training framework for SNNs consisting of four stages. First, we propose a sparse spike correlated topological initialization (SSCTI) method to initialize a sparse network based on node…
Peer Reviews
Decision·ICLR 2026 Poster
1. CH-SNN achieves ultra-high sparsity (>90% on some datasets) without performance degradation. 2. The four-stage framework is well-structured and includes ablation studies showing the necessity of SSCTI and SSWI for stable training under extreme sparsity.
1. All experiments are conducted on relatively simple tasks using very shallow networks. The lack of evaluation on more complex datasets and deeper SNNs raises serious doubts about scalability. For example, the extremely high sparsity achieved on MNIST is likely attributable to the simplicity of the task, whereas the sparsity drops significantly on CIFAR. It can be inferred that on more challenging benchmarks like ImageNet, the claimed “ultra-sparse” may not be achievable. In contrast, works lik
The paper presents an approach to ultra-sparse SNN training, integrating initialization, pruning methods, and Cannistraci-Hebb-inspired topological regrowth. Experiments were conducted on multiple datasets, and thorough ablation experiments and sensitivity analyses were carried out. The framework is implemented on a hardware-friendly algorithm S-TP, achieving significant gains in energy efficiency.
Some key areas of the mathematical description, particularly around pruning and regrowth, lack sufficient clarity.
1. Strong novelty and cross-disciplinary contribution: bridges network science (Cannistraci-Hebb theory) with neuromorphic learning, introducing a biologically and topologically inspired sparse training approach. 2. Comprehensive experimental validation: covers multiple datasets, architectures. 3. Clear modular structure: the four-stage design (SSCTI, SSWI, LRS, CH3-L3) is intuitive and extensible to other SNNs, which provides a reasonable baseline for SNN training.
1. Theoretical insufficiency: The paper lacks formal analysis of the convergence and stability of the CH3-L3 regrowth dynamics. 2. Scalability questions: Experiments are limited to medium-scale datasets. The framework’s behaviour on larger datasets (e.g., ImageNet or DVS-CIFAR100) remains untested. 3. Biological claim ambiguity: The connection to Hebbian principles is mostly conceptual; empirical neuroscientific grounding is minimal.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Ferroelectric and Negative Capacitance Devices · Neural Networks and Reservoir Computing
