Papers › Stochastic Training of Graph Convolutional Networks with Variance Reduction

Stochastic Training of Graph Convolutional Networks with Variance Reduction

29 Oct 2017ICML 2018 7arXiv:1710.10568archive 2025-07-28

Jianfei Chen, Jun Zhu, Le Song

Graph convolutional networks (GCNs) are powerful deep neural networks for graph-structured data. However, GCN computes the representation of a node recursively from its neighbors, making the receptive field size grow exponentially with the number of layers. Previous attempts on reducing the receptive field size by subsampling neighbors do not have a convergence guarantee, and their receptive field size per node is still in the order of hundreds. In this paper, we develop control variate based algorithms which allow sampling an arbitrarily small neighbor size. Furthermore, we prove new theoretical guarantee for our algorithms to converge to a local optimum of GCN. Empirical results show that our algorithms enjoy a similar convergence with the exact algorithm using only two neighbors per node. The runtime of our algorithms on a large Reddit dataset is only one seventh of previous neighbor sampling algorithms.

PaperPDFConference PDFCodeCode Syntology ran

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

Syntology 11 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 11 samples from 1 repository, 7 ran (6 with no instrument failure; 1 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 1 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 7 samples that ran has no recorded date.

thu-ml/stochastic_gcn mentioned on GitHubtfMITSyntology: 11 samples, 7 ran (1 instrument-failed) · 4 unverified 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

11 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 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 · honoured contract
2ran · violated contract
1ran; the contract check could not run
1ran
4unverified

Licence: 3 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. For 3 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from thu-ml/stochastic_gcn. “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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

thu-ml/stochastic_gcn community (archive-listed) 11 samples, 7 ran (1 instrument-failed) · 4 unverified
dot in 68 papers gcn/layers.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) here; the stored copy is pointer only · bc3a2072a2a9cca3 · report fixture: signature x:EagerTensor/2/float, y:EagerTensor/2/float, sparse:bool/0/bool · returned EagerTensor · level recorded 2026-09-22
get_layer_uid in 30 papers gcn/layers.py ran · honoured contract fingerprinted MIT (permissive) here; the stored copy is pointer only · b82968db452628fd · report fixture: signature layer_name:str/0/str · returned int · level recorded 2026-09-22
masked_accuracy in 14 papers gcn/metrics.py ran · violated contract MIT (permissive) · b89d4728d3c8578d · report fixture: signature preds:EagerTensor/2/float, labels:EagerTensor/2/float, mask:EagerTensor/1/int · returned EagerTensor · level recorded 2026-09-22
masked_entropy gcn/metrics.py ran MIT (permissive) · 01e8f9665fda5b1d · report fixture: signature logits:SymbolicTensor/2/float, mask:SymbolicTensor/1/float · returned EagerTensor · level recorded 2026-09-26
masked_softmax_cross_entropy in 11 papers gcn/metrics.py ran · honoured contract MIT (permissive) · d103f29cc58337a2 · report fixture: signature preds:EagerTensor/2/float, labels:EagerTensor/2/float, mask:EagerTensor/1/float · returned EagerTensor · level recorded 2026-09-22
parse_index_file in 54 papers gcn/utils.py ran · honoured contract MIT (permissive) here; the stored copy is pointer only · c1d6392f89c5e495 · report fixture: signature filename:str/0/str · returned list · level recorded, date not recorded
sample_mask in 39 papers
census: 4 implementations from 5 papers, 4 distinct outputs on one shared input
gcn/utils.py ran · violated contract fingerprinted MIT (permissive) · b32fd748b4bbe3bf · report fixture: signature idx:int/0/int, l:int/0/int · returned ndarray · level recorded 2026-09-22
glorot in 26 papers gcn/inits.py unverified MIT (permissive) · 0828b0182597436a · report
sparse_dropout in 30 papers gcn/layers.py unverified MIT (permissive) · 89f0c89b676a4a82 · report
uniform in 58 papers gcn/inits.py unverified MIT (permissive) · 4c4b48cc045c8e12 · report
zeros in 26 papers gcn/inits.py unverified MIT (permissive) · 681e93201c975fb9 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: StoGCN

GCNStoGCN

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