Methods › Graphs › Graph Representation Learning › GraphSAINT
Graph sampling based inductive learning method
GraphSAINT
Introduced by Hanqing Zeng et al. in GraphSAINT: Graph Sampling Based Inductive Learning Method
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Scalable method to train large scale GNN models via sampling small subgraphs.
In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.
From the lookup's note on this name: Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “GraphSAINT: Graph Sampling Based Inductive Learning Method” (arXiv:1907.04931, 1,231 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1907.04931: its page on this site · ask the lookup about it.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 7 · with a code link: 4 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 7 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 7 of 7, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Lifelong Graph Learning for Graph Summarization 25 Jul 2024 · 1 repository · arXiv:2407.18042
-
PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks 25 Jun 2023 · 0 repositories · arXiv:2306.14357
-
BitGNN: Unleashing the Performance Potential of Binary Graph Neural Networks on GPUs 4 May 2023 · 0 repositories · arXiv:2305.02522
-
A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs 11 Nov 2022 · 1 repository · arXiv:2211.06292Syntology official (archive's flag): 2 ran · 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 (of 3 harvested samples)
-
Decoupling the Depth and Scope of Graph Neural Networks 19 Jan 2022 · 1 repository · arXiv:2201.07858Syntology official (archive's flag): 1 ran · 1 ran (of which 0 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) · 1 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
On Batch-size Selection for Stochastic Training for Graph Neural Networks 1 Jan 2021 · 0 repositories
-
GraphSAINT: Graph Sampling Based Inductive Learning Method 10 Jul 2019 · 8 repositories · arXiv:1907.04931
Tasks archive 2025-07-28
15 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
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