Enhancing Distribution and Label Consistency for Graph Out-of-Distribution Generalization
Proposed framework improves graph OOD generalization by jointly enhancing environment augmentation and invariant subgraph extraction consistency.
Published Jan 7, 2025arXiv ↗

Only vote on papers you've read. Sign in with GitHub to vote.
A unified modifier that collapses augmentation and extraction into one pipeline improves graph OOD consistency and efficiency, though its gains against separate steps remain unproven by missing ablations and unbounded label-drift claims.
Abstract
To deal with distribution shifts in graph data, various graph out-of-distribution (OOD) generalization techniques have been recently proposed. These methods often employ a two-step strategy that first creates augmented environments and subsequently identifies invariant subgraphs to improve generalizability. Nevertheless, this approach could be suboptimal from the perspective of consistency. First, the process of augmenting environments by altering the graphs while preserving labels may lead to graphs that are not realistic or meaningfully related to the origin distribution, thus lacking distribution consistency. Second, the extracted subgraphs are obtained from directly modifying graphs, and may not necessarily maintain a consistent predictive relationship with their labels, thereby impacting label consistency. In response to these challenges, we introduce an innovative approach that aims to enhance these two types of consistency for graph OOD generalization. We propose a modifier to obtain both augmented and invariant graphs in a unified manner. With the augmented graphs, we enrich the training data without compromising the integrity of label-graph relationships. The label consistency enhancement in our framework further preserves the supervision information in the invariant graph. We conduct extensive experiments on real-world datasets to demonstrate the superiority of our framework over other state-of-the-art baselines.