EDBT 2026 Demo / reviewers in the wild / expert
Alessandro Muscoloni
dblp:158/8670
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Graph learning · 54% Efficient and distributed learning · 46% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link Prediction · NeurIPS 2025 |
Machine learning › Graph learning › graph neural network
message passing |
0.9 | 1 | 2025 | Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link Prediction · NeurIPS 2025 |
Graph algorithms and graph theory › network analysis
link prediction |
0.9 | 1 | 2025 | Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link Prediction · NeurIPS 2025 |
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
network topology learning |
0.8 | 1 | 2024 | Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learning · ICLR 2024 |
Machine learning › Efficient and distributed learning › model compression
sparse training |
0.8 | 1 | 2024 | Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learning · ICLR 2024 |
Data mining › network analysis
complex network analysis |
0.3 | 1 | 2025 | Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link Prediction · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
network automata · 2.6cannistraci-hebb theory · 2.6adaptive rule selection · 2.6link prediction · 0.8epitopological learning · 0.8cannistraci-hebb rule · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Adaptive Cannistraci-Hebb Network Automata Modelling of Complex Networks for Path-based Link PredictionabstractMany complex networks have partially observed or evolving connectivity, making link prediction a fundamental task.
Topological link prediction infers missing links using only network topology, with applications in social, biological, and technological systems.
The Cannistraci-Hebb (CH) theory provides a topological formulation of Hebbian learning, grounded on two pillars:
(1) the **minimization of external links** within local communities, and
(2) the **path-based definition of local communities** that capture homophilic (similarity-driven) interactions via paths of length 2 and synergetic (diversity-driven) interactions via paths of length 3.
Building on this, we introduce the Cannistraci-Hebb Adaptive (CHA) network automata, an adaptive learning machine that automatically selects the optimal CH rule and path length to model each network.
CHA unifies theoretical interpretability and data-driven adaptivity, bridging physics-inspired network science and machine intelligence.
Across 1,269 networks from 14 domains, CHA consistently surpasses state-of-the-art methods—including SPM, SBM, graph embedding methods, and message-passing graph neural networks—while revealing the mechanistic principles governing link formation. Our code is available at https://github.com/biomedical-cybernetics/Cannistraci_Hebb_network_automata. Jialin Zhao 0004, Alessandro Muscoloni, Umberto Michieli, Yingtao Zhang, Carlo V. Cannistraci |
NeurIPS | 2 |
| 2024 | Epitopological learning and Cannistraci-Hebb network shape intelligence brain-inspired theory for ultra-sparse advantage in deep learningabstractSparse 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 ultra-sparse 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 Meta-deep 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 meta-deep (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 4-step 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 code is available at: https://github.com/biomedical-cybernetics/Cannistraci-Hebb-training Yingtao Zhang, Jialin Zhao 0004, Alessandro Muscoloni, Carlo V. Cannistraci |
ICLR | 4 |