Negative as Positive: Enhancing Out-of-distribution Generalization for Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 25 May 2024.
Builds on
28 of 37 references.
References · 28
- 2017Graph Attention Networkscited by 8,923
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2018Deep Graph Infomaxcited by 1,106
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2013Domain Generalization via Invariant Feature Representationcited by 623
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
- 2021Graph Contrastive Learning Automatedcited by 287
16 more
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2022Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanismcited by 171
- 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 164
- 2018Domain Generalization via Conditional Invariant Representationcited by 146
- 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 141
- 2021Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learningcited by 130
- 2020Towards Domain-Agnostic Contrastive Learningcited by 75
- 2021Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learningcited by 70
- 2019Domain Generalization via Multidomain Discriminant Analysiscited by 69
- 2020Contrastive Self-supervised Learning for Graph Classificationcited by 68
- 2022COSTA: Covariance-Preserving Feature Augmentation for Graph Contrastive Learningcited by 39
- 2020GraphCL: Contrastive Self-Supervised Learning of Graph Representationscited by 26
- 2023Causality and Independence Enhancement for Biased Node Classificationcited by 13
- 2023Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Networkcited by 10
- 2023Bridged-GNN: Knowledge Bridge Learning for Effective Knowledge Transfercited by 10
- 2021Stable Prediction on Graphs with Agnostic Distribution Shiftcited by 9
Built on by
Citing papers per year: 2025: 2.
2 papers.