GraphSAINT: Graph Sampling Based Inductive Learning Method
Abstract
Graph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs. To scale GCNs to large graphs, state-of-the-art methods use various layer sampling techniques to alleviate the ``neighbor explosion'' problem during minibatch training. We propose GraphSAINT, a graph sampling based inductive learning method that improves training efficiency and accuracy in a fundamentally different way. By changing perspective, GraphSAINT constructs minibatches by sampling the training graph, rather than the nodes or edges across GCN layers. Each iteration, a complete GCN is built from the properly sampled subgraph. Thus, we ensure fixed number of well-connected nodes in all layers. We further propose normalization technique to eliminate bias, and sampling algorithms for variance reduction. Importantly, we can decouple the sampling from the forward and backward propagation, and extend GraphSAINT with many architecture variants (e.g., graph attention, jumping connection). GraphSAINT demonstrates superior performance in both accuracy and training time on five large graphs, and achieves new state-of-the-art F1 scores for PPI (0.995) and Reddit (0.970).
Benchmark Results
Tested on 3 datasets 3 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | EnGCN | 0.9714
±0.0003 | |
| 2 | SAGN+SLE | 0.9710 | |
| 3 | GAMLP(JK) | 0.9704
±0.0001 | |
| 15 | GraphSAINT-EDGE | 0.9660
±0.0010 | This paper |
| 16 | GraphSAINT-RW | 0.9660
±0.0010 | This paper |
| 14 | GraphSAGE | 0.9660 best reported | best at pub: GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs (2018) best today: Accelerating Large Scale Real-Time GNN Inference using Channel Pruning (2021) |
| 24 | GraphSAINT-MRW | 0.9640 | This paper |
| 22 | S-GCN | 0.9640
±0.0010 | This paper |
| 23 | AS-GCN | 0.9640
±0.0010 best reported | |
| 34 | GraphSAINT-Node | 0.9620
±0.0010 | This paper |
| 48 | ClusterGCN | 0.9570 best reported | best today: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 58 | GCN | 0.9530
±0.0010 best reported | best today: GraphMAE: Self-Supervised Masked Graph Autoencoders (KDD 2022) |
| 91 | FastGCN | 0.9370 best reported | best at pub: FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling (ICLR 2018) |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | |
| 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) |
| 30 | GraphSAINT-EDGE | 0.9810
±0.0070 | This paper |
| 31 | GraphSAINT-RW | 0.9810
±0.0040 | This paper |
| 32 | GraphSAINT-MRW | 0.9800
±0.0060 | This paper |
| 71 | S-GCN | 0.9630
±0.0100 | This paper |
| 75 | GraphSAINT-Node | 0.9600
±0.0010 | This paper |
| 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 | |
| 173 | MLP | 0.4620 |
Other Graph Benchmarks
Amazon2M
Global leaderboard →Sorted by F1-micro. Highlighted rows are from other papers.
| # | Model | F1-micro ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAINT-RW | 0.8150
±0.0010 | This paper |
| 2 | GraphSAINT-MRW | 0.8090
±0.0010 | This paper |
| 3 | GraphSAINT-EDGE | 0.8070
±0.0010 | This paper |
| 4 | GraphSAINT-Node | 0.7820
±0.0040 | This paper |
| 5 | ClusterGCN | 0.7590
±0.0080 | This paper |
| 6 | GraphSAGE | 0.7580
±0.0020 | This paper |
| 7 | GCN | 0.2810
±0.0050 | This paper |
| 8 | FastGCN | 0.1740
±0.0210 | This paper |
