SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2110.09807 · NeurIPS · 2021

Learning to Learn Graph Topologies

Xiaowen Dong, Siheng Chen, Xingyue Pu, Tianyue Cao, Xiaoyun Zhang

arXiv · PDF · Open in the Atlas

Code that ran

3 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (3 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 0 failures of our instrument; 2 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/2110.09807.json · badge: /api/ran/2110.09807.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
xpuoxford/l2g-neurips2021 canonical (classifier label)
classifier basis: classifier_2025
3 ran · 2 no recorded run
FunctionStatusWhere it lives
GraphConvLayer Ran
ran on a synthesized input · constructed an object; no result was computed
xpuoxford/l2g-neurips2021/src/models.py
pointer only (licence: NONE) · get_code("6a76fab2baf3ecfb")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xpuoxford/l2g-neurips2021 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.

GraphEnc Ran
ran on a synthesized input · constructed an object; no result was computed
xpuoxford/l2g-neurips2021/src/models.py
pointer only (licence: NONE) · get_code("50e3fdbe22a7fda7")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xpuoxford/l2g-neurips2021 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.

TopoDiffVAE Ran
ran on a synthesized input · constructed an object; no result was computed
xpuoxford/l2g-neurips2021/src/models.py
pointer only (licence: NONE) · get_code("77da6a71b71fcf6a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xpuoxford/l2g-neurips2021 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.

init_weights Not yet run
unverified (harvested, no recorded run)
xpuoxford/l2g-neurips2021/src/models.py
pointer only (licence: NONE) · get_code("fbf92b2af01a0211")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xpuoxford/l2g-neurips2021 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.

learn2graph Not yet run
unverified (harvested, no recorded run)
xpuoxford/l2g-neurips2021/src/models.py
pointer only (licence: NONE) · get_code("993df9c3bc1d9f9e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xpuoxford/l2g-neurips2021 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 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 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.

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

Learning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the problem can be formulated as a regularised convex optimisation over a positive semidefinite cone and solved by iterative algorithms. Classic methods require an explicit convex function to reflect generic topological priors, e.g. the 1 penalty for enforcing sparsity, which limits the flexibility and expressiveness in learning rich topological structures. We propose to learn a mapping from node data to the graph structure based on the idea of learning to optimise (L2O). Specifically, our model first unrolls an iterative primal-dual splitting algorithm into a neural network. The key structural proximal projection is replaced with a variational autoencoder that refines the estimated graph with enhanced topological properties. The model is trained in an end-to-end fashion with pairs of node data and graph samples. Experiments on both synthetic and real-world data demonstrate that our model is more efficient than classic iterative algorithms in learning a graph with specific topological properties.

For agents

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

get_harvested_code_for_paper("2110.09807")
get_code_for_paper("2110.09807")
have("2110.09807")

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

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

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

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

Connect an agent — have() is free.