Papers › Hierarchical Graph Representation Learning with Differentiable Pooling

Hierarchical Graph Representation Learning with Differentiable Pooling

22 Jun 2018NeurIPS 2018 12arXiv:1806.08804archive 2025-07-28

Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, Jure Leskovec

Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction. However, current GNN methods are inherently flat and do not learn hierarchical representations of graphs---a limitation that is especially problematic for the task of graph classification, where the goal is to predict the label associated with an entire graph. Here we propose DiffPool, a differentiable graph pooling module that can generate hierarchical representations of graphs and can be combined with various graph neural network architectures in an end-to-end fashion. DiffPool learns a differentiable soft cluster assignment for nodes at each layer of a deep GNN, mapping nodes to a set of clusters, which then form the coarsened input for the next GNN layer. Our experimental results show that combining existing GNN methods with DiffPool yields an average improvement of 5-10% accuracy on graph classification benchmarks, compared to all existing pooling approaches, achieving a new state-of-the-art on four out of five benchmark data sets.

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 20 code samples harvested from 4 repositories linked to this paper: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 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): 20 samples from 4 repositories, 10 ran (9 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 3 of its repositories that Syntology harvested for other papers:

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

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

AaltoPML/Rethinking-pooling-in-GNNs mentioned on GitHubpytorchSyntology: not harvested report
PasqualeAuriemma/GCN-DIFFPOOL mentioned on GitHubtfSyntology: 1 sample, 0 ran · 1 unverified report
RexYing/diffpool mentioned on GitHubpytorchMITSyntology: 7 samples, 2 ran (1 instrument-failed) · 5 unverified report
RexYing/graph-pooling mentioned on GitHubpytorchMITSyntology: not harvested report
Tioz90/DiffPool mentioned on GitHubtfSyntology: not harvested report
Tioz90/GCN mentioned on GitHubtfSyntology: not harvested report
VoVAllen/diffpool mentioned on GitHubpytorchSyntology: not harvested report
basiralab/RG-Select mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Semi-Supervised Classification with Graph Convolutional Networks (arXiv:1609.02907; that paper's own run record: 39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified) and 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
basiralab/Reproducible-Generative-Learning mentioned on GitHubpytorchSyntology: not harvested report
basiralab/reproduciblefedgnn mentioned on GitHubpytorchMITSyntology: 11 samples, 7 ran (0 instrument-failed) · 4 unverified report
chappers/graph-differential-pooling mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
gospodima/extended-simgnn mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to How Powerful are Graph Neural Networks? (arXiv:1810.00826; that paper's own run record: 6 ran (of which 2 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) · 4 unverified); nothing checks that they implement this paper's method. report
gitlab.com/cedric_sanders/masterarbeit mentioned on GitHubpytorchSyntology: not harvested 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

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

1ran; the contract check could not run
9ran
10unverified

Licence: 0 of the 20 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.

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.

PasqualeAuriemma/GCN-DIFFPOOL community (archive-listed) 1 sample, 0 ran · 1 unverified
frobenius_norm_tf models.py unverified MIT (permissive) · 0b25aff2096336db · report
RexYing/diffpool community (archive-listed) 7 samples, 2 ran (1 instrument-failed) · 5 unverified
exp_moving_avg util.py ran; the contract check could not run (RAISES) fingerprinted MIT (permissive) · dd691d00aa5cc146 · report fixture: signature x:list/1/float, decay:float/0/float · returned list · level recorded 2026-09-24
gen_2community_ba gen/data.py ran MIT (permissive) · 712b1b3a42060fb0 · report fixture: signature n_range:list/1/int, m_range:list/1/int, num_graphs:int/0/int, inter_prob:float/0/float, feature_generators:list/1/GaussianFeatureGen · returned list · level recorded 2026-09-26
gen_ba gen/data.py unverified MIT (permissive) · 854d177d079f1cd3 · report
gen_er gen/data.py unverified MIT (permissive) · 9c9fec82cf325ebc · report
kruskal partition.py unverified MIT (permissive) · eb9659a87e71ae20 · report
node_dict util.py unverified MIT (permissive) · d3550a1e301975aa · report
node_iter util.py unverified MIT (permissive) · f55bf28721abc66d · report
basiralab/reproduciblefedgnn community (archive-listed) 11 samples, 7 ran (0 instrument-failed) · 4 unverified
Mean_W_Cv federated_reproducibility/Analysis.py ran MIT (permissive) · d13d56b516dc4831 · report fixture: signature dataset:str/0/str, model:str/0/str, view:int/0/int · returned ndarray · level recorded 2026-09-26
Models_trained federated_reproducibility/Analysis.py ran MIT (permissive) · 0540a7e365607e63 · report fixture: signature dataset:str/0/str, view:int/0/int · returned bool · level recorded 2026-09-26
average_weights in 13 papers federated_reproducibility/fed_localmodel.py ran MIT (permissive) · 63d220d8b4f8afd5 · report fixture: signature weights:list/1/dict · returned dict · level recorded 2026-09-26
datasets_splits federated_reproducibility/cross_val.py ran MIT (permissive) · 1f11f715f1139ba1 · report fixture: signature folds:list/1/list, args:dict/0/?, val_idx:int/0/int · returned tuple · level recorded 2026-09-26
get_adjs federated_reproducibility/dataLoader_medmnist.py ran fingerprinted MIT (permissive) · 07ed65681aebf2db · report fixture: signature i:int/0/int, j:int/0/int, n:int/0/int · returned list · level recorded 2026-09-26
img_to_adj federated_reproducibility/dataLoader_medmnist.py ran fingerprinted MIT (permissive) · 3a7c82cbbc34ab03 · report fixture: signature image:ndarray/2/float · returned ndarray · level recorded 2026-09-26
minmax_sc federated_reproducibility/main_diffpool.py ran fingerprinted MIT (permissive) · 81b03223cd6f4d43 · report fixture: signature x:ndarray/2/float · returned ndarray · level recorded 2026-09-26
Mean_W_Two_shot federated_reproducibility/Analysis.py unverified MIT (permissive) · a2ab7f58736f25f8 · report
evaluate in 514 papers federated_reproducibility/main_diffpool.py unverified MIT (permissive) · 1e9d378dbb12714b · report
evaluate in 514 papers federated_reproducibility/main_gcn.py unverified MIT (permissive) · 96903513f7177254 · report
train in 522 papers federated_reproducibility/main_gcn.py unverified MIT (permissive) · 640adefa68f0073d · report
chappers/graph-differential-pooling community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
dense_diff_pool diff_pool.py ran MIT (permissive) · 2cd5bd6f6bc85e88 · report fixture: signature x:Tensor/3/float, adj:Tensor/3/float, s:Tensor/3/float, mask:Tensor/2/bool · returned tuple · level recorded 2026-09-26

Tasks

General ClassificationGraph ClassificationGraph Neural NetworkGraph Representation LearningLink PredictionNode ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification COLLAB GNN (DiffPool) Accuracy 75.48% #24 of 39 Archive leaderboard report
Graph Classification D&D S2V (with 2 DiffPool) Accuracy 82.07% #7 of 53 Archive leaderboard report
Graph Classification D&D GNN (DiffPool) Accuracy 80.64% #12 of 53 Archive leaderboard report
Graph Classification ENZYMES S2V (with 2 DiffPool) Accuracy 63.33% #24 of 54 Archive leaderboard report
Graph Classification ENZYMES GNN (DiffPool) Accuracy 62.53% #25 of 54 Archive leaderboard report
Graph Classification PROTEINS GNN (DiffPool) Accuracy 76.25% #55 of 103 Archive leaderboard report
Graph Classification REDDIT-MULTI-12K GNN (DiffPool) Accuracy 47.08 #1 of 3 Archive leaderboard report
Graph Property Prediction ogbg-code2 DiffPool w/ graphSAGE Ext. data No #21 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 DiffPool w/ graphSAGE Number of params 10095826 #21 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 DiffPool w/ graphSAGE Test F1 score 0.1401 ± 0.0012 #21 of 21 Archive leaderboard report
Graph Property Prediction ogbg-code2 DiffPool w/ graphSAGE Validation F1 score 0.1405 ± 0.0012 #21 of 21 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: DiffPool

DiffPool

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