Papers › Enhancing Size Generalization in Graph Neural Networks through Disentangled...

Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning

7 Jun 2024arXiv:2406.04601archive 2025-07-28

Zheng Huang, Qihui Yang, Dawei Zhou, Yujun Yan

Although most graph neural networks (GNNs) can operate on graphs of any size, their classification performance often declines on graphs larger than those encountered during training. Existing methods insufficiently address the removal of size information from graph representations, resulting in sub-optimal performance and reliance on backbone models. In response, we propose DISGEN, a novel and model-agnostic framework designed to disentangle size factors from graph representations. DISGEN employs size- and task-invariant augmentations and introduces a decoupling loss that minimizes shared information in hidden representations, with theoretical guarantees for its effectiveness. Our empirical results show that DISGEN outperforms the state-of-the-art models by up to 6% on real-world datasets, underscoring its effectiveness in enhancing the size generalizability of GNNs. Our codes are available at: https://github.com/GraphmindDartmouth/DISGEN.

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="2406.04601")

Code

Syntology Ran 15 of 18 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong; 13 ran with no contract checked.

By repository: official repository: 18 samples from 1 repository, 15 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

graphminddartmouth/disgen officialmentioned in paperpytorch 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

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

1ran · honoured contract
1ran · our draft was wrong
13ran
3unverified

Licence: 18 of the 18 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 graphminddartmouth/disgen. “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.

check_silo_data graphminddartmouth/disgen/src/util_new.py official repository ran no licence file found · pointer only · a75d5816d752d0e5 · report
create_structural_feature graphminddartmouth/disgen/src/datapreprocessing.py official repository ran no licence file found · pointer only · 149e64821bdf2fa7 · report
eval_rocauc graphminddartmouth/disgen/src/train_util.py official repository ran no licence file found · pointer only · 43b70be4ca4a732e · report
find_size_idx graphminddartmouth/disgen/src/util.py official repository ran no licence file found · pointer only · 062c9d71e9d3f5e6 · report
graph_aug_size_change_label_unchange graphminddartmouth/disgen/src/aug_util.py official repository ran no licence file found · pointer only · 976aeab585b3d8eb · report
l2_loss graphminddartmouth/disgen/src/criteria_util.py official repository ran fingerprinted no licence file found · pointer only · bc45d2d5f2331fc0 · report
load_idx_files graphminddartmouth/disgen/src/util.py official repository ran no licence file found · pointer only · d501ac9794d5c880 · report
load_iid_idx_files graphminddartmouth/disgen/src/util.py official repository ran no licence file found · pointer only · 1af7d0e5f943d366 · report
pair_loss graphminddartmouth/disgen/src/criteria_util.py official repository ran fingerprinted no licence file found · pointer only · a0a9578d357f0198 · report
pair_loss_cos graphminddartmouth/disgen/src/criteria_util.py official repository ran fingerprinted no licence file found · pointer only · 01b834528c818ffa · report
quick_test_data_prep graphminddartmouth/disgen/src/datapreprocessing.py official repository ran no licence file found · pointer only · eedec99dead946f2 · report
read_file graphminddartmouth/disgen/src/graphsst2_dataset.py official repository ran · honoured contract no licence file found · pointer only · 60ccd1c98038811b · report
split graphminddartmouth/disgen/src/graphsst2_dataset.py official repository ran no licence file found · pointer only · fe7d97d9abf11937 · report
train_step graphminddartmouth/disgen/src/train_util.py official repository ran no licence file found · pointer only · 93792408ad287326 · report
undirected_graph graphminddartmouth/disgen/src/graphsst2_dataset.py official repository ran · our draft was wrong no licence file found · pointer only · dde52a0f318548b4 · report
cal_edge_grad graphminddartmouth/disgen/src/aug_util.py official repository unverified no licence file found · pointer only · 9f95db60d3c2c127 · report
eval_step graphminddartmouth/disgen/src/train_util.py official repository unverified no licence file found · pointer only · 8dd72428904bc682 · report
graph_explainer graphminddartmouth/disgen/src/aug_util.py official repository unverified no licence file found · pointer only · 87208e7a715a064c · report

Tasks

Representation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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