Learning Network Dismantling Without Handcrafted Inputs
Not on the map. Why?
Abstract (arXiv)
The application of message-passing Graph Neural Networks has been a breakthrough for important network science problems. However, the competitive performance often relies on using handcrafted structural features as inputs, which increases computational cost and introduces bias into the otherwise purely data-driven network representations. Here, we eliminate the need for handcrafted features by introducing an attention mechanism and utilizing message-iteration profiles, in addition to an effective algorithmic approach to generate a structurally diverse training set of small synthetic networks. Thereby, we build an expressive message-passing framework and use it to efficiently solve the NP-hard problem of Network Dismantling, virtually equivalent to vital node identification, with significant real-world applications. Trained solely on diversified synthetic networks, our proposed model -- MIND: Message Iteration Network Dismantler -- generalizes to large, unseen real networks with millions of nodes, outperforming state-of-the-art network dismantling methods. Increased efficiency and generalizability of the proposed model can be leveraged beyond dismantling in a range of complex network problems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 28 references that are in the map. First posted on arXiv 1 Aug 2025.
Builds on
15 of 28 references.
References · 15
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 881
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
- 2016Discriminative Embeddings of Latent Variable Models for Structured Datacited by 131
- 2021On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphscited by 49
- 2015Influence maximization in complex networks through optimal percolationcited by 21
- 2018Generalized Network Dismantlingcited by 13
3 more
- 2016Network dismantlingcited by 12
- 2016Immunization and targeted destruction of networks using explosive percolationcited by 4
- 2018The dynamical structure of political corruption networkscited by 3
Built on by
Not cited yet.