mlsanityData to 7 Oct 2026

Empowering Graph Invariance Learning with Deep Spurious Infomax

arXiv 2407.11083 ↗First posted 13 Jul 2024cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Recently, there has been a surge of interest in developing graph neural networks that utilize the invariance principle on graphs to generalize the out-of-distribution (OOD) data. Due to the limited knowledge about OOD data, existing approaches often pose assumptions about the correlation strengths of the underlying spurious features and the target labels. However, this prior is often unavailable and will change arbitrarily in the real-world scenarios, which may lead to severe failures of the existing graph invariance learning methods. To bridge this gap, we introduce a novel graph invariance learning paradigm, which induces a robust and general inductive bias. The paradigm is built upon the observation that the infomax principle encourages learning spurious features regardless of spurious correlation strengths. We further propose the EQuAD framework that realizes this learning paradigm and employs tailored learning objectives that provably elicit invariant features by disentangling them from the spurious features learned through infomax. Notably, EQuAD shows stable and enhanced performance across different degrees of bias in synthetic datasets and challenging real-world datasets up to 31.76%. Our code is available at urlhttps://github.com/tianyao-aka/EQuAD.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 43 of its 66 references that are in the map. First posted on arXiv 13 Jul 2024.

Builds on

43 of 66 references.

References · 43

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  5. 2019Invariant Risk Minimizationcited by 1,832
  6. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  7. 2017Enhancing The Reliability of Out-of-distribution Image Detection in Neural Networkscited by 1,325
  8. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
  9. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  10. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
  11. 2018Deep Graph Infomaxcited by 1,101
  12. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
31 more
  1. 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
  2. 2015Deep Learning and the Information Bottleneck Principlecited by 793
  3. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
  4. 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
  5. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  6. 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
  7. 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
  8. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
  9. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
  10. 2020Environment Inference for Invariant Learningcited by 306
  11. 2021Identity-aware Graph Neural Networkscited by 197
  12. 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
  13. 2020Invariant Risk Minimization Gamescited by 188
  14. 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
  15. 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
  16. 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
  17. 2022Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphscited by 144
  18. 2021Nested Graph Neural Networkscited by 136
  19. 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
  20. 2020Graph Information Bottleneck for Subgraph Recognitioncited by 119
  21. 2021An Empirical Study of Graph Contrastive Learningcited by 113
  22. 2021Causal Attention for Interpretable and Generalizable Graph Classificationcited by 108
  23. 2020On Learning Sets of Symmetric Elementscited by 97
  24. 2022How Powerful are K-hop Message Passing Graph Neural Networkscited by 90
  25. 2022Graph Rationalization with Environment-based Augmentationscited by 70
  26. 2019k-hop Graph Neural Networkscited by 57
  27. 2023Does Invariant Graph Learning via Environment Augmentation Learn Invariance?cited by 42
  28. 2021Learning Representations that Support Robust Transfer of Predictorscited by 17
  29. 2022Learning useful representations for shifting tasks and distributionscited by 14
  30. 2023Identifying Semantic Component for Robust Molecular Property Predictioncited by 10
  31. 2024Improving the Expressiveness of K-hop Message-Passing GNNs by Injecting Contextualized Substructure Informationcited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 8; 2026: 4.

14 papers.

Sort:

By area: