Empowering Graph Invariance Learning with Deep Spurious Infomax
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 \url{https://github.com/tianyao-aka/EQuAD}.
Code (1)
Tasks
Inductive BiasSimilar Papers 제목 키워드 기반
Invariance Pair Guidance: Robustness to Spurious Correlations via Corrective Gradients
Machine learning models are inherently bound to the distribution of the training data, often exploiting non-causal shortcuts. As a result, achieving robustness to spurious correlations remains a challenge. While existing…
Graph Embedding Using Infomax for ASD Classification and Brain Functional Difference Detection
Significant progress has been made using fMRI to characterize the brain changes that occur in ASD, a complex neuro-developmental disorder. However, due to the high dimensionality and low signal-to-noise ratio of fMRI, em…
ClassificationGeneral ClassificationGraph EmbeddingGraph Neural NetworkCounterfactual Invariance to Spurious Correlations in Text Classification
Informally, a 'spurious correlation' is the dependence of a model on some aspect of the input data that an analyst thinks shouldn't matter. In machine learning, these have a know-it-when-you-see-it character; e.g., chang…
Causal InferenceClassificationcounterfactualtext-classification+1Counterfactual Invariance to Spurious Correlations: Why and How to Pass Stress Tests
Informally, a 'spurious correlation' is the dependence of a model on some aspect of the input data that an analyst thinks shouldn't matter. In machine learning, these have a know-it-when-you-see-it character; e.g., chang…
Causal Inferencecounterfactualtext-classificationText ClassificationGraph Pooling via Coarsened Graph Infomax
Graph pooling that summaries the information in a large graph into a compact form is essential in hierarchical graph representation learning. Existing graph pooling methods either suffer from high computational complexit…
Contrastive LearningGraph Representation LearningRepresentation Learning