mlsanityData to 7 Oct 2026

Learning Invariant Representations of Graph Neural Networks via Cluster Generalization

arXiv 2403.03599 ↗First posted 6 Mar 2024cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) have become increasingly popular in modeling graph-structured data due to their ability to learn node representations by aggregating local structure information. However, it is widely acknowledged that the test graph structure may differ from the training graph structure, resulting in a structure shift. In this paper, we experimentally find that the performance of GNNs drops significantly when the structure shift happens, suggesting that the learned models may be biased towards specific structure patterns. To address this challenge, we propose the Cluster Information Transfer (CIT) mechanism (Code available at https://github.com/BUPT-GAMMA/CITGNN), which can learn invariant representations for GNNs, thereby improving their generalization ability to various and unknown test graphs with structure shift. The CIT mechanism achieves this by combining different cluster information with the nodes while preserving their cluster-independent information. By generating nodes across different clusters, the mechanism significantly enhances the diversity of the nodes and helps GNNs learn the invariant representations. We provide a theoretical analysis of the CIT mechanism, showing that the impact of changing clusters during structure shift can be mitigated after transfer. Additionally, the proposed mechanism is a plug-in that can be easily used to improve existing GNNs. We comprehensively evaluate our proposed method on three typical structure shift scenarios, demonstrating its effectiveness in enhancing GNNs' performance.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 6 Mar 2024.

Builds on

30 of 40 references.

References · 30

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  4. 2016Variational Graph Auto-Encoderscited by 1,373
  5. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  6. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  7. 2020Simple and Deep Graph Convolutional Networkscited by 857
  8. 2018Link Prediction Based on Graph Neural Networkscited by 829
  9. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
  10. 2019Heterogeneous Graph Attention Networkcited by 732
  11. 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
  12. 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
18 more
  1. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
  2. 2020Design Space for Graph Neural Networkscited by 182
  3. 2019Probabilistic Face Embeddingscited by 171
  4. 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
  5. 2020Graph Clustering with Graph Neural Networkscited by 163
  6. 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
  7. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  8. 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 140
  9. 2021Interpreting and Unifying Graph Neural Networks with An Optimization Frameworkcited by 131
  10. 2016Graph-Structured Representations for Visual Question Answeringcited by 123
  11. 2022Uncertainty Modeling for Out-of-Distribution Generalizationcited by 122
  12. 2021Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Datacited by 86
  13. 2021New Benchmarks for Learning on Non-Homophilous Graphscited by 81
  14. 2022Debiased Graph Neural Networks with Agnostic Label Selection Biascited by 25
  15. 2023Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution Generalizationcited by 18
  16. 2018High-dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm, and Missing Datacited by 17
  17. 2019A Convex Optimization Approach to High-Dimensional Sparse Quadratic Discriminant Analysiscited by 10
  18. 2023A Simple and Powerful Framework for Stable Dynamic Network Embeddingcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 2; 2026: 3.

10 papers.