arXiv:2505.11776cs.LGcs.AI2025-05

融合对比与生成学习,提升图表示在多任务上的表现

Generative and Contrastive Graph Representation Learning

  • 结合社区感知的节点级对比学习与图级对比学习
  • 在多个基准数据集上性能提升0.23%-2.01%
  • 适合需要多任务统一表示的图学习场景

图的自监督学习(SSL)可生成用于节点分类、聚类和链接预测等下游任务的节点与图嵌入,尤其适用于标签数据稀缺的情况。现有方法主要分为对比和生成两类:对比方法在分类任务中表现更优,而生成方法在链接预测中更具优势。本文提出一种新架构,融合两者的优点。框架引入社区感知的节点级对比学习,增强正负样本生成效果;同时采用图级对比学习捕捉全局语义信息。此外,通过特征掩码、节点扰动与边扰动相结合的综合增强策略,实现鲁棒且多样化的表示学习。实验表明,该模型在多个任务上均超越当前最优方法,在不同数据集和任务下性能提升0.23%至2.01%。

原文摘要 · Abstract (English)

Self-supervised learning (SSL) on graphs generates node and graph representations (i.e., embeddings) that can be used for downstream tasks such as node classification, node clustering, and link prediction. Graph SSL is particularly useful in scenarios with limited or no labeled data. Existing SSL methods predominantly follow contrastive or generative paradigms, each excelling in different tasks: contrastive methods typically perform well on classification tasks, while generative methods often excel in link prediction. In this paper, we present a novel architecture for graph SSL that integrates the strengths of both approaches. Our framework introduces community-aware node-level contrastive learning, providing more robust and effective positive and negative node pairs generation, alongside graph-level contrastive learning to capture global semantic information. Additionally, we employ a comprehensive augmentation strategy that combines feature masking, node perturbation, and edge perturbation, enabling robust and diverse representation learning. By incorporating these enhancements, our model achieves superior performance across multiple tasks, including node classification, clustering, and link prediction. Evaluations on open benchmark datasets demonstrate that our model outperforms state-of-the-art methods, achieving a performance lift of 0.23%-2.01% depending on the task and dataset.

图表示学习自监督对比学习生成模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。