Enhancing Size Generalization in Graph Neural Networks through Disentangled Representation Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 37 of its 55 references that are in the map. First posted on arXiv 7 Jun 2024.
Builds on
37 of 55 references.
References · 37
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Invariant Risk Minimizationcited by 1,832
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2020GraphCodeBERT: Pre-training Code Representations with Data Flowcited by 600
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
25 more
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2020Parameterized Explainer for Graph Neural Networkcited by 423
- 2020Explainability in Graph Neural Networks: A Taxonomic Surveycited by 383
- 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
- 2018Invariant and Equivariant Graph Networkscited by 339
- 2021On Explainability of Graph Neural Networks via Subgraph Explorationscited by 280
- 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
- 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
- 2021Training Graph Neural Networks with 1000 Layerscited by 169
- 2020Machine Learning on Graphs: A Model and Comprehensive Taxonomycited by 156
- 2019Relational Pooling for Graph Representationscited by 150
- 2022Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphscited by 144
- 2022Data Augmentation for Deep Graph Learning: A Surveycited by 132
- 2021Self-supervised Graph-level Representation Learning with Local and Global Structurecited by 125
- 2020From Local Structures to Size Generalization in Graph Neural Networkscited by 119
- 2021Size-Invariant Graph Representations for Graph Classification Extrapolationscited by 82
- 2020Fairness by Learning Orthogonal Disentangled Representationscited by 76
- 2020Convergence and Stability of Graph Convolutional Networks on Large Random Graphscited by 75
- 2021Multi-VAE: Learning Disentangled View-common and View-peculiar Visual Representations for Multi-view Clusteringcited by 51
- 2020Neural Execution Engines: Learning to Execute Subroutinescited by 36
- 2022SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networkscited by 36
- 2021Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practicescited by 24
- 2021Semi-supervised Domain Adaptation via Sample-to-Sample Self-Distillationcited by 23
- 2023ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learningcited by 5
- 2019Graph Neural Networks for Small Graph and Giant Network Representation Learning: An Overviewcited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 2.
6 papers.
- 2024A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptationcited by 16
- 2024Graph Neural Network Generalization with Gaussian Mixture Model Based Augmentationcited by 2
- 2024Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networkscited by 1
- 2025From Small to Large: Generalization Bounds for Transformers on Variable-Size Inputscited by 1
- 2024Score-based Conditional Out-of-Distribution Augmentation for Graph Covariate Shiftcited by 0
- 2025Learning Repetition-Invariant Representations for Polymer Informaticscited by 0
- 2025From Small to Large: Generalization Bounds for Transformers on Variable-Size Inputs14 Dec 2025
- 2025Learning Repetition-Invariant Representations for Polymer Informatics15 May 2025
- 2024Graph Neural Network Generalization with Gaussian Mixture Model Based Augmentation13 Nov 2024
- 2024Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networks31 Oct 2024
- 2024A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation25 Oct 2024
- 2024Score-based Conditional Out-of-Distribution Augmentation for Graph Covariate Shift23 Oct 2024