Papers › GraphSAINT: Graph Sampling Based Inductive Learning Method

GraphSAINT: Graph Sampling Based Inductive Learning Method

10 Jul 2019ICLR 2020 1arXiv:1907.04931archive 2025-07-28

Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan, Viktor Prasanna

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).

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

GraphSAINT/GraphSAINT officialmentioned in papertfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Graph Attention Networks (arXiv:1710.10903; that paper's own run record: 61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified); nothing checks that they implement this paper's method. report
GraphSAINT/GraphACT mentioned on GitHubSyntology: not harvested report
hyeamykim/GCN-related-works mentioned on GitHubSyntology: not harvested report
lt610/GraphSaint mentioned on GitHubpytorchSyntology: not harvested report
maysambehmanesh/SGCL mentioned on GitHubpytorchSyntology: not harvested report
thudm/graphmae2 mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learner (arXiv:2304.04779; that paper's own run record: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
xingsumq/us-defake mentioned on GitHubpytorchSyntology: not harvested report
dmlc/dgl pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph AttentionGraph EmbeddingGraph Representation LearningGraph SamplingInductive LearningNode ClassificationNode Property Prediction

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Property Prediction ogbl-citation2 GraphSAINT (GCN aggr) Ext. data No #19 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 GraphSAINT (GCN aggr) Number of params 296449 #19 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 GraphSAINT (GCN aggr) Test MRR 0.7985 ± 0.0040 #19 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 GraphSAINT (GCN aggr) Validation MRR 0.7975 ± 0.0039 #19 of 23 Archive leaderboard report
Node Classification PPI GraphSAINT F1 99.50 #3 of 24 Archive leaderboard report
Node Classification Reddit GraphSAINT Accuracy 97.0% #6 of 16 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT + metapath2vec Ext. data No #28 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT + metapath2vec Number of params 309764724 #28 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT + metapath2vec Test Accuracy 0.4966 ± 0.0022 #28 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT + metapath2vec Validation Accuracy 0.5066 ± 0.0017 #28 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT (R-GCN aggr) Ext. data No #30 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT (R-GCN aggr) Number of params 154366772 #30 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT (R-GCN aggr) Test Accuracy 0.4751 ± 0.0022 #30 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag GraphSAINT (R-GCN aggr) Validation Accuracy 0.4837 ± 0.0026 #30 of 39 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT-inductive Ext. data No #46 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT-inductive Number of params 331661 #46 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT-inductive Test Accuracy 0.8027 ± 0.0026 #46 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT-inductive Validation Accuracy Please tell us #46 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT (SAGE aggr) Ext. data No #51 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT (SAGE aggr) Number of params 206895 #51 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT (SAGE aggr) Test Accuracy 0.7908 ± 0.0024 #51 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAINT (SAGE aggr) Validation Accuracy 0.9162 ± 0.0008 #51 of 64 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Introduced by this paper: GraphSAINT

GCNGraphSAINT

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections