用融合吴方法提升图对比学习,兼顾节点与结构信息。
A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning
- 结合节点与子图对比,引入融合吴方法度量结构差异
- 在多个基准数据集上超越或持平现有最优模型
- 适用于同质与异质图,自动构建正负样本对
自监督学习在标签数据稀缺时成为训练深度模型的关键方法。尽管图机器学习在多个领域展现出巨大潜力,但设计有效的预训练任务仍具挑战性。对比学习作为主流方法,通过正负样本对计算损失函数,但现有图对比学习方法难以充分捕捉结构模式和节点相似性。为此,我们提出一种新方法——融合吴沃瑟斯坦子图对比学习(FOSSIL)。该模型整合节点级与子图级对比学习,将标准节点级对比损失与融合吴沃瑟斯坦距离无缝结合,有效联合捕获节点特征与图结构信息。重要的是,该方法在同质与异质图上均表现良好,并能动态生成视图以构造正负样本对。在多个基准图数据集上的大量实验表明,FOSSIL性能优于或媲美当前最先进方法。
原文摘要 · Abstract (English)
Self-supervised learning has become a key method for training deep learning models when labeled data is scarce or unavailable. While graph machine learning holds great promise across various domains, the design of effective pretext tasks for self-supervised graph representation learning remains challenging. Contrastive learning, a popular approach in graph self-supervised learning, leverages positive and negative pairs to compute a contrastive loss function. However, current graph contrastive learning methods often struggle to fully use structural patterns and node similarities. To address these issues, we present a new method called Fused Gromov Wasserstein Subgraph Contrastive Learning (FOSSIL). Our model integrates node-level and subgraph-level contrastive learning, seamlessly combining a standard node-level contrastive loss with the Fused Gromov-Wasserstein distance. This combination helps our method capture both node features and graph structure together. Importantly, our approach works well with both homophilic and heterophilic graphs and can dynamically create views for generating positive and negative pairs. Through extensive experiments on benchmark graph datasets, we show that FOSSIL outperforms or achieves competitive performance compared to current state-of-the-art methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。