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
摘要
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
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connectedYingtao Zhang, Diego Cerretti, Jialin Zhao, Wenjing Wu 等NeurIPS 2025 · 被引用 5 次
- Cannistraci-Hebb Training on Ultra-Sparse Spiking Neural NetworksYuan Hua, Jilin Zhang, Yingtao Zhang, Leyi You 等ICLR 2026 · 被引用 2 次
- Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption RobustnessBoqian Wu, Qiao Xiao, Shunxin Wang, Nicola Strisciuglio 等ICLR 2025
- Dynamic Sparse Training of Diagonally Sparse NetworksAbhishek Tyagi, Arjun Iyer, William H. Renninger, Christopher Kanan 等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
它引用的顶会 Paper8
- SparseGPT: Massive Language Models Can be Accurately Pruned in One-ShotElias Frantar, Dan AlistarhICML 2023 · 被引用 1,240 次
- Scaling Vision with Sparse Mixture of ExpertsCarlos Riquelme, Joan Puigcerver, Basil Mustafa, Maxim Neumann 等NeurIPS 2021 · 被引用 1,213 次
- A Simple and Effective Pruning Approach for Large Language ModelsMingjie Sun, Zhuang Liu, Anna Bair, J. Zico KolterICLR 2024 · 被引用 794 次
- Rigging the Lottery: Making All Tickets WinnersUtku Evci, Trevor Gale, Jacob Menick, Pablo Samuel Castro 等ICML 2020 · 被引用 723 次
- Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable MasksItay Hubara, Brian Chmiel, Moshe Island, Ron Banner 等NeurIPS 2021 · 被引用 148 次
相关 Paper
- Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link PredictionJialin Zhao, Alessandro Muscoloni, Umberto Michieli, Yingtao Zhang 等NeurIPS 2025 · 被引用 1 次
- Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse TrainingShiwei Liu, Lu Yin, Decebal Constantin Mocanu, Mykola PechenizkiyICML 2021 · 被引用 146 次
- ESL-SNNs: An Evolutionary Structure Learning Strategy for Spiking Neural NetworksJiangrong Shen, Qi Xu, Jian K. Liu, Yueming Wang 等AAAI 2023 · 被引用 64 次
- Dynamic Sparse Training: Find Efficient Sparse Network From Scratch With Trainable Masked LayersJunjie Liu, Zhe Xu, Runbin Shi, Ray C. C. Cheung 等ICLR 2020 · 被引用 136 次
- Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networksDaiki Chijiwa, Shin'ya Yamaguchi, Atsutoshi Kumagai, Yasutoshi IdaNeurIPS 2022 · 被引用 12 次
