IENE: Identifying and Extrapolating the Node Environment for Out-of-Distribution Generalization on Graphs
Not on the map. Why?
Abstract (arXiv)
Due to the performance degradation of graph neural networks (GNNs) under distribution shifts, the work on out-of-distribution (OOD) generalization on graphs has received widespread attention. A novel perspective involves distinguishing potential confounding biases from different environments through environmental identification, enabling the model to escape environmentally-sensitive correlations and maintain stable performance under distribution shifts. However, in graph data, confounding factors not only affect the generation process of node features but also influence the complex interaction between nodes. We observe that neglecting either aspect of them will lead to a decrease in performance. In this paper, we propose IENE, an OOD generalization method on graphs based on node-level environmental identification and extrapolation techniques. It strengthens the model's ability to extract invariance from two granularities simultaneously, leading to improved generalization. Specifically, to identify invariance in features, we utilize the disentangled information bottleneck framework to achieve mutual promotion between node-level environmental estimation and invariant feature learning. Furthermore, we extrapolate topological environments through graph augmentation techniques to identify structural invariance. We implement the conceptual method with specific algorithms and provide theoretical analysis and proofs for our approach. Extensive experimental evaluations on two synthetic and four real-world OOD datasets validate the superiority of IENE, which outperforms existing techniques and provides a flexible framework for enhancing the generalization of GNNs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 47 of its 63 references that are in the map. First posted on arXiv 2 Jun 2024.
Builds on
47 of 63 references.
References · 47
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Invariant Risk Minimizationcited by 1,832
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
35 more
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2017One pixel attack for fooling deep neural networkscited by 579
- 2019Multi-scale Attributed Node Embeddingcited by 543
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
- 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
- 2020Environment Inference for Invariant Learningcited by 306
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2020No Subclass Left Behind: Fine-Grained Robustness in Coarse-Grained Classification Problemscited by 208
- 2019Topology Attack and Defense for Graph Neural Networks: An Optimization Perspectivecited by 196
- 2020Invariant Risk Minimization Gamescited by 188
- 2022Discovering Invariant Rationales for Graph Neural Networkscited by 186
- 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
- 2019A Meta-Transfer Objective for Learning to Disentangle Causal Mechanismscited by 158
- 2022Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphscited by 144
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2020Invariant Rationalizationcited by 131
- 2022Out-Of-Distribution Generalization on Graphs: A Surveycited by 97
- 2021Heterogeneous Risk Minimizationcited by 90
- 2021Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Datacited by 86
- 2021Size-Invariant Graph Representations for Graph Classification Extrapolationscited by 82
- 2016Hiding Individuals and Communities in a Social Networkcited by 77
- 2019Stable Learning via Sample Reweightingcited by 70
- 2022Empowering Graph Representation Learning with Test-Time Graph Transformationcited by 66
- 2020Stable Prediction with Model Misspecification and Agnostic Distribution Shiftcited by 62
- 2022ZIN: When and How to Learn Invariance Without Environment Partition?cited by 58
- 2022Pareto Invariant Risk Minimization: Towards Mitigating the Optimization Dilemma in Out-of-Distribution Generalizationcited by 38
- 2023Mind the Label Shift of Augmentation-based Graph OOD Generalizationcited by 34
- 2024Graph Out-of-Distribution Generalization via Causal Interventioncited by 30
- 2021Learning Conjoint Attentions for Graph Neural Netscited by 26
- 2022Debiased Graph Neural Networks with Agnostic Label Selection Biascited by 25
- 2020Disentangled Information Bottleneckcited by 24
- 2021Learning Representations that Support Robust Transfer of Predictorscited by 17
- 2023Causality and Independence Enhancement for Biased Node Classificationcited by 13
Built on by
Not cited yet.