Papers › Inductive Representation Learning on Large Graphs

Inductive Representation Learning on Large Graphs

7 Jun 2017NeurIPS 2017 12arXiv:1706.02216archive 2025-07-28

William L. Hamilton, Rex Ying, Jure Leskovec

Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches are inherently transductive and do not naturally generalize to unseen nodes. Here we present GraphSAGE, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data. Instead of training individual embeddings for each node, we learn a function that generates embeddings by sampling and aggregating features from a node's local neighborhood. Our algorithm outperforms strong baselines on three inductive node-classification benchmarks: we classify the category of unseen nodes in evolving information graphs based on citation and Reddit post data, and we show that our algorithm generalizes to completely unseen graphs using a multi-graph dataset of protein-protein interactions.

PaperPDFConference PDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also 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

The archive's official repository (williamleif/GraphSAGE) was not harvested; the 5 samples below come from 4 community repositories.

Syntology 5 code samples harvested from 4 repositories linked to this paper: 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 5 samples from 4 repositories, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 5 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

20 repositories listed; official and paper-mentioned ones first.

williamleif/GraphSAGE officialmentioned on GitHubtfSyntology: not harvested report
Arvidsmile/InductiveDialogueGraph mentioned on GitHubtfSyntology: not harvested report
IllinoisGraphBenchmark/IGB-Datasets mentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report
arangoml/fastgraphml mentioned on GitHubpytorchSyntology: not harvested report
chatterjeeayan/upna mentioned on GitHubpytorchSyntology: not harvested report
erfmah/answering_graph_queries mentioned on GitHubpytorchSyntology: not harvested report
hmcreamer/hackRice19 mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
isotlaboratory/ml4vrp mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
massquantity/LibRecommender mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Self-supervised Learning for Large-scale Item Recommendations (arXiv:2007.12865; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
pmlg/pytorch_GCN mentioned on GitHubpytorchSyntology: not harvested report
qema/orca-py mentioned on GitHubpytorchSyntology: not harvested report
silent-code/deep-trace mentioned on GitHubtfSyntology: not harvested report
stellargraph/stellargraph mentioned on GitHubtfApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Adversarial Examples on Graph Data: Deep Insights into Attack and Defense (arXiv:1903.01610; that paper's own run record: 10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
weiyinwei/huign mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
weiyinwei/mmgcn mentioned on GitHubpytorchSyntology: not harvested report
zxhhh97/ABot mentioned on GitHubpytorchMITSyntology: 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
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
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
pyg-team/pytorch_geometric pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Learning the Geometry of Data: A Mathematical Review of Shape Space Analysis (arXiv:2606.17022; that paper's own run record: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified); nothing checks that they implement this paper's method. report
twjiang/graphSAGE-pytorch pytorchSyntology: 2 samples, 2 ran (0 instrument-failed) · 0 unverified 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

5 samples harvested: 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran
2unverified

Licence: 5 of the 5 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

hmcreamer/hackRice19 community (archive-listed) 1 sample, 0 ran · 1 unverified
SAGENet graph_nn_model/model.py unverified no licence file found · pointer only · 8197e3286158358f · report
isotlaboratory/ml4vrp community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
GraphSAGE modules/layers.py ran no licence file found · pointer only · 8484b4398c279c3c · report fixture: returned GraphSAGE · level recorded 2026-09-22
weiyinwei/huign community (archive-listed) 1 sample, 0 ran · 1 unverified
SAGEConv SAGEConv.py unverified no licence file found · pointer only · d05cb3c8a409d6ad · report
twjiang/graphSAGE-pytorch community (archive-listed) 2 samples, 2 ran (0 instrument-failed) · 0 unverified
GraphSage src/models.py ran · metamorphic tier: deterministic no licence file found · pointer only · 558609a1292ff548 · report fixture: returned GraphSage · level recorded 2026-09-22
SageLayer src/models.py ran no licence file found · pointer only · 5383fe9de3b3494e · report fixture: signature self_feats:Tensor/2/float, aggregate_feats:Tensor/2/float, neighs:NoneType/0/? · returned Tensor · level recorded 2026-09-24

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

4 assemblies on this paper: 4 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

4 sibling assemblies for GraphSAGE (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for GraphSAGE (graph method: GraphSAGE). 2 bricks; individually on a fixture: 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. GraphSage entry · level 1 · ran · 558609a1292ff548
  2. SageLayer model · level 1 · ran · 5383fe9de3b3494e

harvested Assembly for GraphSAGE (graph method: GraphSAGE). 1 brick; individually on a fixture: 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. The assembly has not been run end-to-end.

one of 4 siblings

  1. GraphSAGE entry · level 1 · ran · 8484b4398c279c3c

harvested Assembly for GraphSAGE (graph method: GraphSAGE). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. SAGENet entry · level 0 · unverified · 8197e3286158358f

harvested Assembly for GraphSAGE (graph method: GraphSAGE). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 4 siblings

  1. SAGEConv entry · level 0 · unverified · d05cb3c8a409d6ad

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="1706.02216") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Graph ClassificationGraph RegressionLink PredictionLink Property PredictionNode ClassificationNode Classification on Non-Homophilic (Heterophilic) GraphsNode Property PredictionRepresentation Learning

Datasets

Introduced by this paper, per the archive.

PPIReddit

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification CIFAR10 100k GraphSage Accuracy (%) 66.08 #17 of 20 Archive leaderboard report
Graph Regression ZINC-500k GraphSage MAE 0.398 #34 of 36 Archive leaderboard report
Graph Regression ZINC-full GraphSAGE Test MAE 0.126±0.003 #18 of 19 Archive leaderboard report
Link Property Prediction ogbl-citation2 Full-batch GraphSAGE Ext. data No #16 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 Full-batch GraphSAGE Number of params 460289 #16 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 Full-batch GraphSAGE Test MRR 0.8260 ± 0.0036 #16 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 Full-batch GraphSAGE Validation MRR 0.8263 ± 0.0033 #16 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 NeighborSampling (SAGE aggr) Ext. data No #17 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 NeighborSampling (SAGE aggr) Number of params 460289 #17 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 NeighborSampling (SAGE aggr) Test MRR 0.8044 ± 0.0010 #17 of 23 Archive leaderboard report
Link Property Prediction ogbl-citation2 NeighborSampling (SAGE aggr) Validation MRR 0.8054 ± 0.0009 #17 of 23 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE (val as input) Ext. data No #19 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE (val as input) Number of params 460289 #19 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE (val as input) Test Hits@50 0.5463 ± 0.0112 #19 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE (val as input) Validation Hits@50 0.5688 ± 0.0077 #19 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE Ext. data No #27 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE Number of params 460289 #27 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE Test Hits@50 0.4810 ± 0.0081 #27 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE Validation Hits@50 0.5688 ± 0.0077 #27 of 34 Archive leaderboard report
Link Property Prediction ogbl-collab GraphSAGE (val as input) Number of params 460289 #34 of 34 Archive leaderboard report
Link Property Prediction ogbl-ddi GraphSAGE Ext. data No #24 of 31 Archive leaderboard report
Link Property Prediction ogbl-ddi GraphSAGE Number of params 1421057 #24 of 31 Archive leaderboard report
Link Property Prediction ogbl-ddi GraphSAGE Test Hits@20 0.5390 ± 0.0474 #24 of 31 Archive leaderboard report
Link Property Prediction ogbl-ddi GraphSAGE Validation Hits@20 0.6262 ± 0.0037 #24 of 31 Archive leaderboard report
Link Property Prediction ogbl-ppa GraphSAGE Ext. data No #26 of 26 Archive leaderboard report
Link Property Prediction ogbl-ppa GraphSAGE Number of params 424449 #26 of 26 Archive leaderboard report
Link Property Prediction ogbl-ppa GraphSAGE Test Hits@100 0.1655 ± 0.0240 #26 of 26 Archive leaderboard report
Link Property Prediction ogbl-ppa GraphSAGE Validation Hits@100 0.1724 ± 0.0264 #26 of 26 Archive leaderboard report
Node Classification Brazil Air-Traffic GraphSAGE (Hamilton et al., [2017a]) Accuracy 0.404 #6 of 7 Archive leaderboard report
Node Classification Chameleon (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 62.15 ± 0.42 #26 of 38 Archive leaderboard report
Node Classification CiteSeer (0.5%) GraphSAGE Accuracy 33.8% #14 of 14 Archive leaderboard report
Node Classification CiteSeer (1%) GraphSAGE Accuracy 51.0% #13 of 14 Archive leaderboard report
Node Classification CiteSeer (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 78.24 ± 0.30 #25 of 33 Archive leaderboard report
Node Classification CiteSeer with Public Split: fixed 20 nodes per class GraphSAGE Accuracy 67.2 #36 of 40 Archive leaderboard report
Node Classification Citeseer Full-supervised GraphSAGE Accuracy 71.40% #7 of 7 Archive leaderboard report
Node Classification Cora (0.5%) GraphSAGE Accuracy 37.5% #14 of 15 Archive leaderboard report
Node Classification Cora (1%) GraphSAGE Accuracy 49.0% #13 of 15 Archive leaderboard report
Node Classification Cora (3%) GraphSAGE Accuracy 64.2% #13 of 15 Archive leaderboard report
Node Classification Cora (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 86.58 ± 0.26 #25 of 33 Archive leaderboard report
Node Classification Cora Full-supervised GraphSAGE Accuracy 82.2% #7 of 9 Archive leaderboard report
Node Classification Cora with Public Split: fixed 20 nodes per class GraphSAGE Accuracy 74.5% #36 of 36 Archive leaderboard report
Node Classification Cornell (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 71.41 ± 1.24 #31 of 36 Archive leaderboard report
Node Classification Europe Air-Traffic GraphSAGE (Hamilton et al., [2017a]) Accuracy 27.2 #7 of 7 Archive leaderboard report
Node Classification Facebook GraphSAGE (Hamilton et al., [2017a]) Accuracy 38.9 #8 of 8 Archive leaderboard report
Node Classification Film (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 36.37 ± 0.21 #26 of 37 Archive leaderboard report
Node Classification Flickr GraphSAGE (Hamilton et al., [2017a]) Accuracy 0.641 #3 of 8 Archive leaderboard report
Node Classification PATTERN 100k GraphSage Accuracy (%) 50.516 #9 of 9 Archive leaderboard report
Node Classification PPI GraphSAGE F1 61.2 #21 of 24 Archive leaderboard report
Node Classification PubMed (0.03%) GraphSAGE Accuracy 45.4% #13 of 14 Archive leaderboard report
Node Classification PubMed (0.05%) GraphSAGE Accuracy 53.0% #12 of 14 Archive leaderboard report
Node Classification PubMed (0.1%) GraphSAGE Accuracy 65.4% #12 of 14 Archive leaderboard report
Node Classification PubMed (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 86.85 ± 0.11 #31 of 37 Archive leaderboard report
Node Classification PubMed with Public Split: fixed 20 nodes per class GraphSAGE Accuracy 76.8% #30 of 37 Archive leaderboard report
Node Classification Pubmed Full-supervised GraphSAGE Accuracy 87.1% #7 of 7 Archive leaderboard report
Node Classification Reddit GraphSAGE Accuracy 94.32% #13 of 16 Archive leaderboard report
Node Classification Squirrel (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 41.26 ± 0.26 #26 of 37 Archive leaderboard report
Node Classification Texas (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 79.03 ± 1.20 #31 of 36 Archive leaderboard report
Node Classification USA Air-Traffic GraphSAGE (Hamilton et al., [2017a]) Accuracy 31.6 #7 of 7 Archive leaderboard report
Node Classification Wiki-Vote GraphSAGE (Hamilton et al., [2017a]) Accuracy 24.5 #6 of 6 Archive leaderboard report
Node Classification Wisconsin (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 64.85 ± 5.14 #33 of 35 Archive leaderboard report
Node Classification on Non-Homophilic (Heterophilic) Graphs Chameleon(60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 62.15 ± 0.42 #22 of 32 Archive leaderboard report
Node Classification on Non-Homophilic (Heterophilic) Graphs Cornell (60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 71.41 ± 1.24 #29 of 33 Archive leaderboard report
Node Classification on Non-Homophilic (Heterophilic) Graphs Texas(60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 79.03 ± 1.20 #28 of 32 Archive leaderboard report
Node Classification on Non-Homophilic (Heterophilic) Graphs Wisconsin(60%/20%/20% random splits) GraphSAGE 1:1 Accuracy 64.85 ± 5.14 #30 of 32 Archive leaderboard report
Node Property Prediction ogbn-arxiv GraphSAGE Ext. data No #77 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GraphSAGE Number of params 218664 #77 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GraphSAGE Test Accuracy 0.7149 ± 0.0027 #77 of 86 Archive leaderboard report
Node Property Prediction ogbn-arxiv GraphSAGE Validation Accuracy 0.7277 ± 0.0016 #77 of 86 Archive leaderboard report
Node Property Prediction ogbn-mag NeighborSampling (R-GCN aggr) Ext. data No #32 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag NeighborSampling (R-GCN aggr) Number of params 154366772 #32 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag NeighborSampling (R-GCN aggr) Test Accuracy 0.4678 ± 0.0067 #32 of 39 Archive leaderboard report
Node Property Prediction ogbn-mag NeighborSampling (R-GCN aggr) Validation Accuracy 0.4761 ± 0.0068 #32 of 39 Archive leaderboard report
Node Property Prediction ogbn-papers100M GraphSAGE_res_incep Ext. data No #13 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GraphSAGE_res_incep Number of params 5755172 #13 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GraphSAGE_res_incep Test Accuracy 0.6706 ± 0.0017 #13 of 20 Archive leaderboard report
Node Property Prediction ogbn-papers100M GraphSAGE_res_incep Validation Accuracy 0.7032 ± 0.0011 #13 of 20 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE + C&S + node2vec Ext. data No #37 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE + C&S + node2vec Number of params 103983 #37 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE + C&S + node2vec Test Accuracy 0.8154 ± 0.0050 #37 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE + C&S + node2vec Validation Accuracy 0.9238 ± 0.0006 #37 of 64 Archive leaderboard report
Node Property Prediction ogbn-products NeighborSampling (SAGE aggr) Ext. data No #53 of 64 Archive leaderboard report
Node Property Prediction ogbn-products NeighborSampling (SAGE aggr) Number of params 206895 #53 of 64 Archive leaderboard report
Node Property Prediction ogbn-products NeighborSampling (SAGE aggr) Test Accuracy 0.7870 ± 0.0036 #53 of 64 Archive leaderboard report
Node Property Prediction ogbn-products NeighborSampling (SAGE aggr) Validation Accuracy 0.9170 ± 0.0009 #53 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Full-batch GraphSAGE Ext. data No #54 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Full-batch GraphSAGE Number of params 206895 #54 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Full-batch GraphSAGE Test Accuracy 0.7850 ± 0.0014 #54 of 64 Archive leaderboard report
Node Property Prediction ogbn-products Full-batch GraphSAGE Validation Accuracy 0.9224 ± 0.0007 #54 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE Ext. data No #55 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE Number of params Please tell us #55 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE Test Accuracy 0.7829 ± 0.0016 #55 of 64 Archive leaderboard report
Node Property Prediction ogbn-products GraphSAGE Validation Accuracy Please tell us #55 of 64 Archive leaderboard report
Node Property Prediction ogbn-proteins GraphSAGE Ext. data No #23 of 26 Archive leaderboard report
Node Property Prediction ogbn-proteins GraphSAGE Number of params 193136 #23 of 26 Archive leaderboard report
Node Property Prediction ogbn-proteins GraphSAGE Test ROC-AUC 0.7768 ± 0.0020 #23 of 26 Archive leaderboard report
Node Property Prediction ogbn-proteins GraphSAGE Validation ROC-AUC 0.8334 ± 0.0013 #23 of 26 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: GraphSAGE

GraphSAGE

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