ADMP-GNN: Adaptive Depth Message Passing GNN
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) have proven to be highly effective in various graph learning tasks. A key characteristic of GNNs is their use of a fixed number of message-passing steps for all nodes in the graph, regardless of each node's diverse computational needs and characteristics. Through empirical real-world data analysis, we demonstrate that the optimal number of message-passing layers varies for nodes with different characteristics. This finding is further supported by experiments conducted on synthetic datasets. To address this, we propose Adaptive Depth Message Passing GNN (ADMP-GNN), a novel framework that dynamically adjusts the number of message passing layers for each node, resulting in improved performance. This approach applies to any model that follows the message passing scheme. We evaluate ADMP-GNN on the node classification task and observe performance improvements over baseline GNN models.
Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Builds on 34 of its 47 references that are in the map. First posted on arXiv 1 Sep 2025.
Builds on
34 of 47 references.
References · 34
- 2017Attention Is All You Needcited by 60,106
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,318
- 2017Neural Message Passing for Quantum Chemistrycited by 3,471
- 2016Pruning Filters for Efficient ConvNetscited by 1,138
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,003
- 2016Deep Networks with Stochastic Depthcited by 977
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 709
- 2017Dynamic Routing Between Capsulescited by 689
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
22 more
- 2019Multi-scale Attributed Node Embeddingcited by 546
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 491
- 2016Dynamic Filter Networkscited by 318
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
- 2021Spectral Temporal Graph Neural Network for Multivariate Time-series Forecastingcited by 299
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 270
- 2019Depth-Adaptive Transformercited by 230
- 2016Higher-order organization of complex networkscited by 109
- 2020Glance and Focus: a Dynamic Approach to Reducing Spatial Redundancy in Image Classificationcited by 99
- 2023FAENet: Frame Averaging Equivariant GNN for Materials Modelingcited by 72
- 2022On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networkscited by 64
- 2013Clustering and Community Detection in Directed Networks: A Surveycited by 38
- 2019AdaGCN: Adaboosting Graph Convolutional Networks into Deep Modelscited by 37
- 2022EIGNN: Efficient Infinite-Depth Graph Neural Networkscited by 32
- 2020Adaptive Propagation Graph Convolutional Networkcited by 31
- 2023Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreachingcited by 24
- 2018Deep neural networks algorithms for stochastic control problems on finite horizon: convergence analysiscited by 22
- 2021Evaluating Deep Graph Neural Networkscited by 19
- 2020Expertise and Dynamics within Crowdsourced Musical Knowledge Curation: A Case Study of the Genius Platformcited by 13
- 2024Gegenbauer Graph Neural Networks for Time-varying Signal Reconstructioncited by 12
- 2021Maximizing Influence with Graph Neural Networkscited by 8
Built on by
Citing papers per year: 2026: 3.
3 papers.