SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2006.05806 · 2020

Bandit Samplers for Training Graph Neural Networks

arXiv · PDF · Open in the Atlas

Code that ran

3 of 8 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 5 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2006.05806.json · badge: /api/ran/2006.05806.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
xavierzw/ogb-geniepath-bs canonical (classifier label)
classifier basis: census
3 ran · 5 no recorded run
FunctionStatusWhere it lives
parse_index_file Ran
ran, honoured the contract we drafted
xavierzw/ogb-geniepath-bs/utils.py
pointer only (licence: MIT); the stored copy get_code serves, from DSL-Lab/Specformer, is pointer only (licence: GPL-3.0) · get_code("c1d6392f89c5e495")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

sample_mask Ran
ran, violated the contract we drafted
xavierzw/ogb-geniepath-bs/utils.py
code served (permissive licence) · get_code("b32fd748b4bbe3bf")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned ndarray, ndim 1, dtype family float, shape (5,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

# Analyze the function:
# - idx: used as an index into mask array, should be an integer or array of integers
# - l: used as the length parameter for np.zeros, should be an integer

# Create valid arguments
idx = 2  # Single index into the mask array
l = 5    # Length of the mask array

ARGS = {
    "idx": idx,
    "l": l
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family float, shape (5,) — shape (5,) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
zeros Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
xavierzw/ogb-geniepath-bs/inits.py
pointer only (licence: MIT); the stored copy get_code serves, from flyingdoog/PTDNet, is pointer only (licence: NONE) · get_code("b190ef9c60b2629a")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from flyingdoog/PTDNet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

attention_mechanism Not yet run
unverified (harvested, no recorded run)
xavierzw/ogb-geniepath-bs/models.py
code served (permissive licence) · get_code("e1c745efb699b041")
How it ran

no invocation recorded.

glorot Not yet run
unverified (harvested, no recorded run)
xavierzw/ogb-geniepath-bs/models.py
code served (permissive licence) · get_code("d30cc18b0c05a6ae")
How it ran

no invocation recorded.

glorot Not yet run
unverified (harvested, no recorded run)
xavierzw/ogb-geniepath-bs/inits.py
code served (permissive licence) · get_code("7886d7d7e49e3627")
How it ran

no invocation recorded.

glorot Not yet run
unverified (harvested, no recorded run)
xavierzw/ogb-geniepath-bs/utils.py
code served (permissive licence) · get_code("30f4098902a4d64d")
How it ran

no invocation recorded.

uniform Not yet run
unverified (harvested, no recorded run)
xavierzw/ogb-geniepath-bs/inits.py
pointer only (licence: MIT); the stored copy get_code serves, from flyingdoog/PTDNet, is pointer only (licence: NONE) · get_code("b0d1b78daecde7e9")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from flyingdoog/PTDNet, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 4 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 4 the same month, 4 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
parse_index_file 53 other papers
25 dated earlier, 2 the same month, 26 later · 1 only as an assembly brick
1603.08861 (2016-03)
Revisiting Semi-Supervised Learning with Graph Embeddings
1611.07308 (2016-11)
Variational Graph Auto-Encoders
1710.10568 (2017-10)
Stochastic Training of Graph Convolutional Networks with Variance Reduction
and 50 more not named here
sample_mask 28 other papers
14 dated earlier, 1 the same month, 13 later
1603.08861 (2016-03)
Revisiting Semi-Supervised Learning with Graph Embeddings
1710.10568 (2017-10)
Stochastic Training of Graph Convolutional Networks with Variance Reduction
1710.10903 (2017-10)
Graph Attention Networks
and 25 more not named here
zeros 18 other papers
11 dated earlier, 2 the same month, 5 later
1603.08861 (2016-03)
Revisiting Semi-Supervised Learning with Graph Embeddings
1804.00823 (2018-04)
Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks
1804.01654 (2018-04)
Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images
and 15 more not named here
uniform 17 other papers
11 dated earlier, 2 the same month, 4 later
1603.08861 (2016-03)
Revisiting Semi-Supervised Learning with Graph Embeddings
1804.00823 (2018-04)
Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks
1804.01654 (2018-04)
Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images
and 14 more not named here

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Several sampling algorithms with variance reduction have been proposed for accelerating the training of Graph Convolution Networks (GCNs). However, due to the intractable computation of optimal sampling distribution, these sampling algorithms are suboptimal for GCNs and are not applicable to more general graph neural networks (GNNs) where the message aggregator contains learned weights rather than fixed weights, such as Graph Attention Networks (GAT). The fundamental reason is that the embeddings of the neighbors or learned weights involved in the optimal sampling distribution are changing during the training and not known a priori, but only partially observed when sampled, thus making the derivation of an optimal variance reduced samplers non-trivial. In this paper, we formulate the optimization of the sampling variance as an adversary bandit problem, where the rewards are related to the node embeddings and learned weights, and can vary constantly. Thus a good sampler needs to acquire variance information about more neighbors (exploration) while at the same time optimizing the immediate sampling variance (exploit). We theoretically show that our algorithm asymptotically approaches the optimal variance within a factor of 3. We show the efficiency and effectiveness of our approach on multiple datasets.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2006.05806")
get_code_for_paper("2006.05806")
have("2006.05806")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2006.05806.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2006.05806.svg)](https://syntology.ai/paper/2006.05806)

Connect an agent — have() is free.