Papers › Graph U-Nets

Graph U-Nets

11 May 2019arXiv:1905.05178archive 2025-07-28

Hongyang Gao, Shuiwang Ji

We consider the problem of representation learning for graph data. Convolutional neural networks can naturally operate on images, but have significant challenges in dealing with graph data. Given images are special cases of graphs with nodes lie on 2D lattices, graph embedding tasks have a natural correspondence with image pixel-wise prediction tasks such as segmentation. While encoder-decoder architectures like U-Nets have been successfully applied on many image pixel-wise prediction tasks, similar methods are lacking for graph data. This is due to the fact that pooling and up-sampling operations are not natural on graph data. To address these challenges, we propose novel graph pooling (gPool) and unpooling (gUnpool) operations in this work. The gPool layer adaptively selects some nodes to form a smaller graph based on their scalar projection values on a trainable projection vector. We further propose the gUnpool layer as the inverse operation of the gPool layer. The gUnpool layer restores the graph into its original structure using the position information of nodes selected in the corresponding gPool layer. Based on our proposed gPool and gUnpool layers, we develop an encoder-decoder model on graph, known as the graph U-Nets. Our experimental results on node classification and graph classification tasks demonstrate that our methods achieve consistently better performance than previous models.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1905.05178")

Code

Syntology Ran 3 of 4 code samples harvested from 2 repositories linked to this paper; 1 has no recorded run. Of those that ran: 2 ran · honoured contract; 1 ran · our draft was wrong.

By repository: community (archive-listed): 4 samples from 2 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

HongyangGao/gunet officialmentioned on GitHubpytorchGPL-3.0 report
HongyangGao/Graph-U-Nets mentioned on GitHubpytorch report
hujilin1229/gUNet mentioned on GitHubpytorch 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.

Code Syntology ran Syntology

4 samples harvested; 3 ran; 2 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
1ran · our draft was wrong
1unverified

Licence: 2 of the 4 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

normalize_adj hujilin1229/gUNet/ops.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 597b9f2e337f0d63 · report
normalize_adj_torch hujilin1229/gUNet/ops.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 88e5b6e8be02c080 · report
top_k_graph HongyangGao/Graph-U-Nets/src/utils/ops.py community (archive-listed) ran · our draft was wrong fingerprinted GPL-3.0 (copyleft) · pointer only · 094df4d2b0f19a49 · report
norm_g HongyangGao/Graph-U-Nets/src/utils/ops.py community (archive-listed) unverified GPL-3.0 (copyleft) · pointer only · 3ff2604f52241f1b · report

Tasks

DecoderGeneral ClassificationGraph ClassificationGraph EmbeddingNode ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification COLLAB Graph U-Nets Accuracy 77.56% #22 of 39 Archive leaderboard report
Graph Classification D&D Graph U-Nets Accuracy 82.43% #5 of 53 Archive leaderboard report
Graph Classification PROTEINS Graph U-Nets Accuracy 77.68% #27 of 103 Archive leaderboard report
Node Classification Citeseer Graph U-Nets Accuracy 73.2 ± 0.5% #35 of 71 Archive leaderboard report
Node Classification Cora Graph U-Nets Accuracy 84.4% ± 0.6% #29 of 73 Archive leaderboard report
Node Classification Pubmed Graph U-Nets Accuracy 79.6 ± 0.2% #42 of 70 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.

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