Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again
Abstract
Despite the enormous success of Graph Convolutional Networks (GCNs) in modeling graph-structured data, most of the current GCNs are shallow due to the notoriously challenging problems of over-smoothening and information squashing along with conventional difficulty caused by vanishing gradients and over-fitting. Previous works have been primarily focused on the study of over-smoothening and over-squashing phenomena in training deep GCNs. Surprisingly, in comparison with CNNs/RNNs, very limited attention has been given to understanding how healthy gradient flow can benefit the trainability of deep GCNs. In this paper, firstly, we provide a new perspective of gradient flow to understand the substandard performance of deep GCNs and hypothesize that by facilitating healthy gradient flow, we can significantly improve their trainability, as well as achieve state-of-the-art (SOTA) level performance from vanilla-GCNs. Next, we argue that blindly adopting the Glorot initialization for GCNs is not optimal, and derive a topology-aware isometric initialization scheme for vanilla-GCNs based on the principles of isometry. Additionally, contrary to ad-hoc addition of skip-connections, we propose to use gradient-guided dynamic rewiring of vanilla-GCNs with skip connections. Our dynamic rewiring method uses the gradient flow within each layer during training to introduce on-demand skip-connections adaptively. We provide extensive empirical evidence across multiple datasets that our methods improve gradient flow in deep vanilla-GCNs and significantly boost their performance to comfortably compete and outperform many fancy state-of-the-art methods. Codes are available at:.
Benchmark Results
Tested on 5 datasets 16 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 45 | GCNII | 0.8893
±0.0137 best reported | best at pub: Orthogonal Graph Neural Networks (AAAI 2021) best today: Large Language Model Meets Graph Neural Network in Knowledge Distillation (AAAI 2024) |
| 55 | JKNet | 0.8870 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 223 | SGC | 0.8509
±0.0648 best reported | |
| 420 | topology-aware isometric initialization and Gradient-guided rewiring | 0.8310
±0.0025 | This paper |
| 562 | InceptionGCN | 0.8170 | This paper |
| 602 | Vanilla-GCN | 0.8110 | This paper |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 350 | MLP | 0.7289
±0.0010 | |
| 481 | GCN + Our Init | 0.7170 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 24 | JKNet | 0.9160 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 58 | GCNII | 0.9030
±0.0043 best reported | best at pub: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 141 | SGC | 0.8832
±0.0055 best reported | |
| 210 | MLP | 0.8690
±0.0074 | |
| 436 | topology-aware isometric initialization and Gradient-guided rewiring | 0.8020
±0.1600 | This paper |
| 633 | InceptionGCN | 0.7850 | This paper |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 46 | APPNP | 0.9131
±0.0197 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 70 | GCNII | 0.8918
±0.0443 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Piecewise Constant Spectral Graph Neural Network (TMLR 2025) |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) |
| 330 | SGC | 0.7440
±0.0600 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 392 | JKNet | 0.7000
±0.0549 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) Difference within reported uncertainty; not counted as underperformance. |
| 449 | topology-aware initialization and gradient-guided rewiring | 0.6428
±0.0293 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 138 | SAGE | 0.8269 | |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 396 | topology-aware isometric initialization and Gradient-guided rewiring | 0.5851
±0.0166 | This paper |
