Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learning
Yingtao Zhang, Jialin Zhao, Wenjing Wu, Alessandro Muscoloni, Carlo Vittorio Cannistraci
Abstract
Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultrasparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage against fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi-means new) Learning is via link prediction: predicting the likelihood of non-observed links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Metadeep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is metadeep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4step training methodology that puts ESML at its heart. We conduct experiments on 7 datasets and 5 network structures comparing CHT to dynamic sparse training SOTA algorithms and the fully connected counterparts. The results indicate that, with a mere 1% of links retained during training, CHT surpasses fully connected networks on VGG16, GoogLeNet, ResNet50, and ResNet152. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle that adopts CH3-L3-based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers the first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size. Our
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 3e56bf23-bd5e-4b1f-8ab4-e7770fdf9f77Cited by top-tier papers6
- Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connectedYingtao Zhang, Diego Cerretti, Jialin Zhao, Wenjing Wu et al.NeurIPS 2025 · 5 citations
- Cannistraci-Hebb Training on Ultra-Sparse Spiking Neural NetworksYuan Hua, Jilin Zhang, Yingtao Zhang, Leyi You et al.ICLR 2026 · 2 citations
- Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption RobustnessBoqian Wu, Qiao Xiao, Shunxin Wang, Nicola Strisciuglio et al.ICLR 2025
- Dynamic Sparse Training of Diagonally Sparse NetworksAbhishek Tyagi, Arjun Iyer, William H. Renninger, Christopher Kanan et al.ICML 2025
- Alignment-Enhanced Integration of Connectivity and Spectral Sparsity in Dynamic Sparse Training of LLMWenjing Wu, Yingtao Zhang, Jialin Zhao, Carlo Vittorio CannistraciICLR 2026
Builds on8
- SparseGPT: Massive Language Models Can be Accurately Pruned in One-ShotElias Frantar, Dan AlistarhICML 2023 · 1,240 citations
- Scaling Vision with Sparse Mixture of ExpertsCarlos Riquelme, Joan Puigcerver, Basil Mustafa, Maxim Neumann et al.NeurIPS 2021 · 1,213 citations
- A Simple and Effective Pruning Approach for Large Language ModelsMingjie Sun, Zhuang Liu, Anna Bair, J. Zico KolterICLR 2024 · 794 citations
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro et al.ICML 2020 · 723 citations
- Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable MasksItay Hubara, Brian Chmiel, Moshe Island, Ron Banner et al.NeurIPS 2021 · 148 citations
Related papers
- Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link PredictionJialin Zhao, Alessandro Muscoloni, Umberto Michieli, Yingtao Zhang et al.NeurIPS 2025 · 1 citation
- Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse TrainingShiwei Liu, Lu Yin, Decebal Constantin Mocanu, Mykola PechenizkiyICML 2021 · 146 citations
- ESL-SNNs: An Evolutionary Structure Learning Strategy for Spiking Neural NetworksJiangrong Shen, Qi Xu, Jian K. Liu, Yueming Wang et al.AAAI 2023 · 64 citations
- Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked LayersJunjie Liu, Zhe Xu, Runbin Shi, Ray C. C. Cheung et al.ICLR 2020 · 136 citations
- Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networksDaiki Chijiwa, Shin'ya Yamaguchi, Atsutoshi Kumagai, Yasutoshi IdaNeurIPS 2022 · 12 citations
