Model Degradation Hinders Deep Graph Neural Networks
Abstract
Graph Neural Networks (GNNs) have achieved great success in various graph mining tasks. However, drastic performance degradation is always observed when a GNN is stacked with many layers. As a result, most GNNs only have shallow architectures, which limits their expressive power and exploitation of deep neighborhoods. Most recent studies attribute the performance degradation of deep GNNs to the over-smoothing issue. In this paper, we disentangle the conventional graph convolution operation into two independent operations: Propagation (P) and Transformation (T). Following this, the depth of a GNN can be split into the propagation depth ($D_p$) and the transformation depth ($D_t$). Through extensive experiments, we find that the major cause for the performance degradation of deep GNNs is the model degradation issue caused by large $D_t$ rather than the over-smoothing issue mainly caused by large $D_p$. Further, we present Adaptive Initial Residual (AIR), a plug-and-play module compatible with all kinds of GNN architectures, to alleviate the model degradation issue and the over-smoothing issue simultaneously. Experimental results on six real-world datasets demonstrate that GNNs equipped with AIR outperform most GNNs with shallow architectures owing to the benefits of both large $D_p$ and $D_t$, while the time costs associated with AIR can be ignored.
Benchmark Results
Tested on 2 datasets 8 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 | |
| 72 | GBP | 0.8350
±0.0080 best reported | best at pub: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 77 | SIGN | 0.8310
±0.0080 best reported | best at pub: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 78 | S^2GC | 0.8310
±0.0070 best reported | best at pub: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 83 | GraphSAGE | 0.8287 best reported | |
| 94 | SGC | 0.8220
±0.0090 best reported | best at pub: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 112 | SGC+AIR | 0.8144
±0.0016 | This paper |
| 351 | MLP | 0.6605
±0.0020 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | SGC | 0.7910 best reported | best at pub: Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction (ICLR 2021) best today: Unifews: You Need Fewer Operations for Efficient Graph Neural Networks (ICML 2024) |
| 2 | GAMLP | 0.7036
±0.0002 | |
| 3 | GLEM-GNN | 0.7036
±0.0002 | |
| 17 | SGC+AIR | 0.6723
±0.0020 | This paper |
| 35 | SAGE | 0.6644
±0.0017 | |
| 38 | SIGN | 0.6636
±0.0005 best reported | best at pub: Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced Training (2021) best today: Graph Learning at Scale: Characterizing and Optimizing Pre-Propagation GNNs (2025) |
| 52 | GraphSAGE | 0.6580 best reported | |
| 59 | GBP | 0.6524
±0.0013 | prev best: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) Improvement within reported uncertainty; not highlighted. |
| 64 | S^2GC | 0.6473
±0.0021 | prev best: Evaluating Deep Graph Neural Networks (2021) Improvement within reported uncertainty; not highlighted. |
| 95 | MLP | 0.4960
±0.0030 |
