Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced Training
Abstract
Besides of the existing neighbor sampling techniques applied on common Graph Neural Networks (GNNs), scalable methods allowing normal minibatch training can more easily scale to large scaled graphs. They decouple graph convolutions and other learnable transformations into preprocessing and a scalable classifier. A complex and graph structure-aware classifier is important to achieve competitive performances. By replacing redundant concatenation operation in Scalable Inception Graph Neural Networks (SIGN) with a more graph structure-aware attention mechanism, we propose Scalable and Adaptive Graph Neural Networks (SAGN). SAGN can adaptively gather neighborhood information among different hops. To further improve scalable GNNs by introducing the existing techniques applied on common GNNs for semi-supervised learning tasks, we propose Self-Label-Enhanced (SLE) training approach combining the self-training approach and label propagation in depth. We add the base model with a scalable label model. Then we iteratively train models and enhance the training set in several stages. To generate input of the label model, we apply label propagation based on one-hot encoded label vectors without inner random masking. We find out that empirically the label leakage has been effectively alleviated with enough propagation depth. The hard pseudo labels in the enhanced training set participate in label propagation with true labels, which propagates model knowledge and label information into the whole graph. Experiments on both inductive and transductive datasets demonstrate that, compared with other sampling-based and sampling-free methods, SAGN achieves better or comparable results and SLE can further improve performance.
Benchmark Results
Tested on 5 datasets 6 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | |
| 4 | GraphSAINT | 0.9950 best reported | best at pub: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 21 | GCN | 0.9850 best reported | best at pub: Graph Neural Networks With Convolutional ARMA Filters (2019) best today: Graph-Coupled Oscillator Networks (ICML 2022) |
| 34 | SAGN+SLE | 0.9800
±0.0010 | This paper |
| 41 | SAGN | 0.9790
±0.0010 | This paper |
| 66 | SIGN | 0.9700
±0.0030 | This paper |
| 73 | Stochastic-GCN | 0.9630
±0.0100 | This paper |
| 90 | SGC | 0.8920
±0.0150 | prev best: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 91 | ClusterGCN | 0.8750
±0.0040 | This paper |
| 92 | GIN | 0.8724
±0.0002 | |
| 101 | GraphSAGE | 0.7860 best reported | best at pub: Graph Neural Networks With Convolutional ARMA Filters (2019) best today: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 135 | AS-GCN | 0.6870
±0.0120 | This paper |
| 149 | FastGCN | 0.6370
±0.0060 best reported | best at pub: Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning (2020) |
| 173 | MLP | 0.4620 |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | SGC | 0.7910 | |
| 2 | GAMLP | 0.7036
±0.0002 | |
| 3 | GLEM-GNN | 0.7036
±0.0002 | |
| 14 | SAGN+SLE | 0.6800
±0.0015 | This paper |
| 16 | UniMP | 0.6736
±0.0010 | This paper |
| 29 | SAGN | 0.6675
±0.0084 | This paper |
| 35 | SAGE | 0.6644
±0.0017 | |
| 38 | SIGN | 0.6568
±0.0006 | prev best: SIGN: Scalable Inception Graph Neural Networks (2020) best today: Graph Learning at Scale: Characterizing and Optimizing Pre-Propagation GNNs (2025) |
| 88 | Node2Vec | 0.5810 best reported | best at pub: SIGN: Scalable Inception Graph Neural Networks (2020) |
| 95 | MLP | 0.4960
±0.0030 best reported | best at pub: SIGN: Scalable Inception Graph Neural Networks (2020) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LMSPS+LP+MS | 0.5784
±0.0022 | |
| 2 | SeHGNN+emb+ms | 0.5719
±0.0012 | |
| 3 | SeHGNN+ms | 0.5671
±0.0014 | |
| 27 | SIGN | 0.5289
±0.0011 best reported | best at pub: Scalable Graph Neural Networks for Heterogeneous Graphs (2020) best today: Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization (KDD 2023) |
| 57 | GraphSAGE | 0.4646
±0.0060 best reported | best today: Efficient Heterogeneous Graph Learning via Random Projection (2023) |
| 60 | GCN | 0.4290
±0.0050 best reported | |
| 66 | GIN | 0.3732
±0.0033 | |
| 76 | MLP | 0.3243 best reported | best today: Heterogeneous Graph Representation Learning with Relation Awareness (2021) |
