mlsanityData to 14 Oct 2026

Raising the Bar in Graph OOD Generalization: Invariant Learning Beyond Explicit Environment Modeling

arXiv 2502.10706 ↗First posted 15 Feb 2025cs.LG cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Out-of-distribution (OOD) generalization has emerged as a critical challenge in graph learning, as real-world graph data often exhibit diverse and shifting environments that traditional models fail to generalize across. A promising solution to address this issue is graph invariant learning (GIL), which aims to learn invariant representations by disentangling label-correlated invariant subgraphs from environment-specific subgraphs. However, existing GIL methods face two major challenges: (1) the difficulty of capturing and modeling diverse environments in graph data, and (2) the semantic cliff, where invariant subgraphs from different classes are difficult to distinguish, leading to poor class separability and increased misclassifications. To tackle these challenges, we propose a novel method termed Multi-Prototype Hyperspherical Invariant Learning (MPHIL), which introduces two key innovations: (1) hyperspherical invariant representation extraction, enabling robust and highly discriminative hyperspherical invariant feature extraction, and (2) multi-prototype hyperspherical classification, which employs class prototypes as intermediate variables to eliminate the need for explicit environment modeling in GIL and mitigate the semantic cliff issue. Derived from the theoretical framework of GIL, we introduce two novel objective functions: the invariant prototype matching loss to ensure samples are matched to the correct class prototypes, and the prototype separation loss to increase the distinction between prototypes of different classes in the hyperspherical space. Extensive experiments on 11 OOD generalization benchmark datasets demonstrate that MPHIL achieves state-of-the-art performance, significantly outperforming existing methods across graph data from various domains and with different distribution shifts.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 36 of its 56 references that are in the map. First posted on arXiv 15 Feb 2025.

Builds on

36 of 56 references.

References · 36

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2019Invariant Risk Minimizationcited by 1,854
  3. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
  4. 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
  5. 2021Towards Out-Of-Distribution Generalization: A Surveycited by 436
  6. 2020The Risks of Invariant Risk Minimizationcited by 262
  7. 2020Representation Learning via Invariant Causal Mechanismscited by 199
  8. 2018Hyperspherical Variational Auto-Encoderscited by 189
  9. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 188
  10. 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
  11. 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 164
  12. 2022Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphscited by 144
24 more
  1. 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 141
  2. 2022How to Exploit Hyperspherical Embeddings for Out-of-Distribution Detection?cited by 128
  3. 2021Towards a Theoretical Framework of Out-of-Distribution Generalizationcited by 94
  4. 2021Sequential Recommendation with Graph Neural Networkscited by 89
  5. 2019Hyperspherical Prototype Networkscited by 86
  6. 2021OoD-Bench: Quantifying and Understanding Two Dimensions of Out-of-Distribution Generalizationcited by 86
  7. 2022Debiasing Graph Neural Networks via Learning Disentangled Causal Substructurecited by 83
  8. 2021OOD-GNN: Out-of-Distribution Generalized Graph Neural Networkcited by 78
  9. 2021Generalizing Graph Neural Networks on Out-Of-Distribution Graphscited by 71
  10. 2022Graph Rationalization with Environment-based Augmentationscited by 70
  11. 2020Empirical or Invariant Risk Minimization? A Sample Complexity Perspectivecited by 62
  12. 2022ZIN: When and How to Learn Invariance Without Environment Partition?cited by 58
  13. 2017Deep Hyperspherical Learningcited by 55
  14. 2024ARC: A Generalist Graph Anomaly Detector with In-Context Learningcited by 48
  15. 2023Does Invariant Graph Learning via Environment Augmentation Learn Invariance?cited by 42
  16. 2020Heterogeneous Molecular Graph Neural Networks for Predicting Molecule Propertiescited by 30
  17. 2023Interpretable Prototype-based Graph Information Bottleneckcited by 23
  18. 2023Learning Invariant Molecular Representation in Latent Discrete Spacecited by 19
  19. 2023Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution Generalizationcited by 18
  20. 2024Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmarkcited by 18
  21. 2024Empowering Graph Invariance Learning with Deep Spurious Infomaxcited by 14
  22. 2024HYPO: Hyperspherical Out-of-Distribution Generalizationcited by 13
  23. 2020Latent Causal Invariant Modelcited by 9
  24. 2024Improving out-of-distribution generalization in graphs via hierarchical semantic environmentscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 8.

9 papers.