mlsanityData to 7 Oct 2026

Dissecting the Failure of Invariant Learning on Graphs

arXiv 2411.02847 ↗First posted 5 Nov 2024cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Enhancing node-level Out-Of-Distribution (OOD) generalization on graphs remains a crucial area of research. In this paper, we develop a Structural Causal Model (SCM) to theoretically dissect the performance of two prominent invariant learning methods -- Invariant Risk Minimization (IRM) and Variance-Risk Extrapolation (VREx) -- in node-level OOD settings. Our analysis reveals a critical limitation: due to the lack of class-conditional invariance constraints, these methods may struggle to accurately identify the structure of the predictive invariant ego-graph and consequently rely on spurious features. To address this, we propose Cross-environment Intra-class Alignment (CIA), which explicitly eliminates spurious features by aligning cross-environment representations conditioned on the same class, bypassing the need for explicit knowledge of the causal pattern structure. To adapt CIA to node-level OOD scenarios where environment labels are hard to obtain, we further propose CIA-LRA (Localized Reweighting Alignment) that leverages the distribution of neighboring labels to selectively align node representations, effectively distinguishing and preserving invariant features while removing spurious ones, all without relying on environment labels. We theoretically prove CIA-LRA's effectiveness by deriving an OOD generalization error bound based on PAC-Bayesian analysis. Experiments on graph OOD benchmarks validate the superiority of CIA and CIA-LRA, marking a significant advancement in node-level OOD generalization. The codes are available at https://github.com/NOVAglow646/NeurIPS24-Invariant-Learning-on-Graphs.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 12 of its 57 references that are in the map. First posted on arXiv 5 Nov 2024.

Builds on

12 of 57 references.

References · 12

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  3. 2021Gradient Matching for Domain Generalizationcited by 258
  4. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
  5. 2022Empowering Graph Representation Learning with Test-Time Graph Transformationcited by 66
  6. 2024Graph Out-of-Distribution Generalization via Causal Interventioncited by 30
  7. 2023Spurious Feature Diversification Improves Out-of-distribution Generalizationcited by 26
  8. 2023Graph Invariant Learning with Subgraph Co-mixup for Out-Of-Distribution Generalizationcited by 18
  9. 2023Graph Structure and Feature Extrapolation for Out-of-Distribution Generalizationcited by 10
  10. 2021Stable Prediction on Graphs with Agnostic Distribution Shiftcited by 9
  11. 2024Unifying Invariance and Spuriousity for Graph Out-of-Distribution via Probability of Necessity and Sufficiencycited by 3
  12. 2024Graphs Generalization under Distribution Shiftscited by 3

Built on by

Cited by year (2026 to 7 Oct)

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

5 papers.