LAMP通过可学习元路径增强异构图对比学习,提升无监督性能。
LAMP: Learnable Meta-Path Guided Adversarial Contrastive Learning for Heterogeneous Graphs
- 构建可学习的元路径结构,融合多种子图以稳定表示
- 引入对抗性边剪枝策略,保持图稀疏性并提升鲁棒性
- 在4个数据集上优于现有最优无监督模型
异构图神经网络(HGNNs)显著推动了信息检索领域发展,但其性能高度依赖高质量标签,而标签获取成本高昂。这一挑战促使研究转向异构图对比学习(HGCL),通常需预定义元路径。然而,我们发现元路径组合对无监督设置下的性能影响显著,当前文献常忽略此问题。现有方法在不同元路径组合下结果波动大,影响优化效果。为此,本文提出LAMP(可学习元路径引导的对抗对比学习),将多种元路径子图整合为统一且稳定的结构,利用子图间的重叠关系。为应对整合后图的稠密性,提出对抗性训练策略进行边剪枝,保持稀疏性以提升模型性能与鲁棒性。LAMP旨在最大化元路径视图与网络模式视图之间的差异,引导对比学习捕捉最有意义的信息。在异构图基准(HGB)的四个多样化数据集上的大量实验表明,LAMP在准确率和鲁棒性方面显著优于现有最先进无监督模型。
原文摘要 · Abstract (English)
Heterogeneous graph neural networks (HGNNs) have significantly propelled the information retrieval (IR) field. Still, the effectiveness of HGNNs heavily relies on high-quality labels, which are often expensive to acquire. This challenge has shifted attention towards Heterogeneous Graph Contrastive Learning (HGCL), which usually requires pre-defined meta-paths. However, our findings reveal that meta-path combinations significantly affect performance in unsupervised settings, an aspect often overlooked in current literature. Existing HGCL methods have considerable variability in outcomes across different meta-path combinations, thereby challenging the optimization process to achieve consistent and high performance. In response, we introduce \textsf{LAMP} (\underline{\textbf{L}}earn\underline{\textbf{A}}ble \underline{\textbf{M}}eta-\underline{\textbf{P}}ath), a novel adversarial contrastive learning approach that integrates various meta-path sub-graphs into a unified and stable structure, leveraging the overlap among these sub-graphs. To address the denseness of this integrated sub-graph, we propose an adversarial training strategy for edge pruning, maintaining sparsity to enhance model performance and robustness. \textsf{LAMP} aims to maximize the difference between meta-path and network schema views for guiding contrastive learning to capture the most meaningful information. Our extensive experimental study conducted on four diverse datasets from the Heterogeneous Graph Benchmark (HGB) demonstrates that \textsf{LAMP} significantly outperforms existing state-of-the-art unsupervised models in terms of accuracy and robustness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。