IsGCL: Informative Sample-Aware Progressive Graph Contrastive Learning
Juxiang Zeng, Pinghui Wang, Linbo Ma, Jing Tao, Xiaohong Guan
Abstract
Graph-level Contrastive Learning (GCL) has evolved as a powerful technique to derive representations from contrastive view pairs. Without access to labeled data, GCL typically takes two views augmented from the same graph as a positive pair and embeds them in nearby locations, while treating views from different graphs as negative pairs and pushing away their representations. Since the construction of contrastive pairs plays an important role in GCL, considerable attention has been paid to informative pairs mining. However, existing informative pairs mining methods suffer from the following two challenges: 1) Previous studies merely pay attention to the informative negative pairs while neglecting the informative positive pairs. Nevertheless, most augmentation methods require random perturbations, which may destroy the critical semantics of a graph, leading to false positive pairs (uninformative positives). 2) For informative negatives mining, most existing studies either overly emphasize hard negatives despite their potential unreliability, or rely on precise clustering pseudo-labels, which are error-prone especially in the early training stage. To solve the above challenges, we propose an informative sample-aware progressive graph contrastive learning framework, which filters both uninformative positives and negatives. In particular, we first present a progressive views sampler to evaluate the learning hardness of each view via clustering. Then, we feed model views with appropriate hardness, meaning those that aren't too challenging for the current model to assign pseudo labels confidently. Furthermore, we propose two samplers to filter out uninformative positives and negatives, respectively. Empirical results demonstrate the efficacy of our method IsGCL, which outperforms baselines by a margin of 2.5% on both MUTAG and PTC-MR in unsupervised learning settings. Furthermore, IsGCL maintains competitive training efficiency11Code available at https://github.com/jxzeng-git/IsGCL.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get eec65b68-0dd4-4014-8bdb-d9f6a966b65cRelated papers
- Adversarial Contrastive Graph Augmentation with Counterfactual RegularizationTao Long, Lei Zhang, Liang Zhang, Laizhong CuiAAAI 2025 · 5 citations
- ProGCL: Rethinking Hard Negative Mining in Graph Contrastive LearningJun Xia, Lirong Wu, Ge Wang, Jintao Chen et al.ICML 2022 · 174 citations
- Generating Counterfactual Hard Negative Samples for Graph Contrastive LearningHaoran Yang, Hongxu Chen, Sixiao Zhang, Xiangguo Sun et al.WWW 2023 · 36 citations
- AutoGCL: Automated Graph Contrastive Learning via Learnable View GeneratorsYihang Yin, Qingzhong Wang, Siyu Huang, Haoyi Xiong et al.AAAI 2022 · 203 citations
- B2-Sampling: Fusing Balanced and Biased Sampling for Graph Contrastive LearningMengyue Liu, Yun Lin, Jun Liu, Bohao Liu et al.KDD 2023 · 5 citations
