SCR: Training Graph Neural Networks with Consistency Regularization
Abstract
We present the SCR framework for enhancing the training of graph neural networks (GNNs) with consistency regularization. Regularization is a set of strategies used in Machine Learning to reduce overfitting and improve the generalization ability. However, it is unclear how to best design the generalization strategies in GNNs, as it works in a semi-supervised setting for graph data. The major challenge lies in how to efficiently balance the trade-off between the error from the labeled data and that from the unlabeled data. SCR. is a simple yet general framework in which we introduce two strategies of consistency regularization to address the challenge above. One is to minimize the disagreements among the perturbed predictions by different versions of a GNN model. The other is to leverage the Mean Teacher paradigm to estimate a consistency loss between teacher and student models instead of the disagreement of the predictions. We conducted experiments on three large-scale node classification datasets in the Open Graph Benchmark (OGB). Experimental results demonstrate that the proposed SCR framework is a general one that can enhance various GNNs to achieve better performance. Finally, SCR has been the top-1 entry on all three OGB leaderboards as of this submission.
Benchmark Results
Tested on 3 datasets 4 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 | |
| 6 | GCN | 0.8868 best reported | best at pub: Calibrating and Improving Graph Contrastive Learning (TMLR 2021) |
| 14 | SAGN | 0.8736
±0.0007 best reported | best at pub: Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced Training (2021) best today: Learning on Large-scale Text-attributed Graphs via Variational Inference (ICLR 2022) |
| 20 | SCR | 0.8680
±0.0007 | This paper |
| 21 | SCR-m | 0.8673
±0.0008 | This paper |
| 25 | SLE | 0.8643
±0.0020 | This paper |
| 40 | RLU+SCR | 0.8520
±0.0008 | This paper |
| 51 | RLU | 0.8459
±0.0010 | This paper |
| 58 | MLP+C&S | 0.8418
±0.0007 | This paper |
| 65 | GAMLP | 0.8376
±0.0019 best reported | best at pub: Graph Attention MLP with Reliable Label Utilization (2021) best today: ATLAS: Adaptive Topology-based Learning at Scale for Homophilic and Heterophilic Graphs (2025) Difference within reported uncertainty; not counted as underperformance. |
| 77 | SIGN | 0.8310
±0.0080 best reported | best at pub: Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced Training (2021) best today: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 83 | GraphSAGE | 0.8287 best reported | |
| 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 best reported | best at pub: Graph Attention MLP with Reliable Label Utilization (2021) best today: Learning on Large-scale Text-attributed Graphs via Variational Inference (ICLR 2022) |
| 3 | GLEM-GNN | 0.7036
±0.0002 | |
| 8 | RLU+SCR | 0.6842
±0.0015 | This paper |
| 9 | SLE | 0.6830
±0.0008 | This paper |
| 10 | RLU | 0.6825
±0.0011 | This paper |
| 11 | SCR-m | 0.6816
±0.0012 | This paper |
| 12 | SCR | 0.6814
±0.0008 | This paper |
| 24 | SIGN-XL | 0.6706
±0.0017 | prev best: Graph Attention MLP with Reliable Label Utilization (2021) |
| 29 | SAGN | 0.6675
±0.0084 | 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) |
| 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 | |
| 5 | RLU+SCR | 0.5631
±0.0021 | This paper |
| 6 | RLU | 0.5590
±0.0027 | This paper |
| 12 | SCR-m | 0.5451
±0.0019 | This paper |
| 13 | SLE | 0.5440
±0.0015 | This paper |
| 16 | SCR | 0.5432
±0.0018 | This paper |
| 21 | NARS_GAMLP | 0.5396
±0.0018 | This paper |
| 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) |
| 28 | NARS | 0.5240
±0.0016 | This paper |
| 30 | NARS_SAGN | 0.5232
±0.0025 | This paper |
| 56 | R-GCN | 0.4693
±0.0046 best reported | best at pub: Graph Attention MLP with Reliable Label Utilization (2021) |
| 57 | GraphSAGE | 0.4646
±0.0060 | |
| 76 | MLP | 0.3243 best reported | best at pub: Heterogeneous Graph Representation Learning with Relation Awareness (2021) |
