Negative as Positive: Enhancing Out-of-distribution Generalization for Graph Contrastive Learning
Zixu Wang, Bingbing Xu, Yige Yuan, Huawei Shen, Xueqi Cheng
TL;DR
This work tackles the limited OOD generalization of Graph Contrastive Learning by identifying that treating cross-domain pairs solely as negatives in InfoNCE exacerbates domain gaps. It introduces Negative as Positive (NaP), a framework that reclassifies the most semantically similar cross-domain negatives as positives, implemented via an Encoding Module and a two-stage Objective Module (Warm-Up and NaP stages) with a new loss term. Empirical evaluations on the GOOD benchmark and Facebook100 show that NaP substantially improves OOD performance, narrows the Pairwise Domain Discrepancy, and yields semantically aligned cross-domain pairs, outperforming multiple InfoNCE-based baselines. The findings highlight a practical strategy to enhance cross-domain transfer in graph pre-training, with potential implications for other contrastive learning settings.
Abstract
Graph contrastive learning (GCL), standing as the dominant paradigm in the realm of graph pre-training, has yielded considerable progress. Nonetheless, its capacity for out-of-distribution (OOD) generalization has been relatively underexplored. In this work, we point out that the traditional optimization of InfoNCE in GCL restricts the cross-domain pairs only to be negative samples, which inevitably enlarges the distribution gap between different domains. This violates the requirement of domain invariance under OOD scenario and consequently impairs the model's OOD generalization performance. To address this issue, we propose a novel strategy "Negative as Positive", where the most semantically similar cross-domain negative pairs are treated as positive during GCL. Our experimental results, spanning a wide array of datasets, confirm that this method substantially improves the OOD generalization performance of GCL.
