arXiv:2604.05732cs.LGcs.IR2026-04

提升异构图表示学习效果,通过优化图结构来增强下游任务性能。

Graph Topology Information Enhanced Heterogeneous Graph Representation Learning

  • 引入任务相关拓扑信息构建新图结构,分离图优化与表征学习以降低内存开销。
  • 在五个真实数据集上显著优于现有方法,最大提升达15.2%。
  • 适合处理异构图表示学习中结构噪声多、内存消耗大的场景。

现实世界中的异构图通常存在噪声且非下游任务的最优结构,严重影响图表示学习模型性能。尽管已有图结构学习(GSL)方法可同步优化图结构与下游任务,但多数针对同质图设计,异构图的GSL仍缺乏研究。主要挑战在于:异构图的输入结构质量对基于GNN的表示学习影响更显著;直接将同质图模型应用于异构图会引发内存瓶颈。为此,本文提出一种新型异构图表示学习框架ToGRL,通过融合任务相关的潜在拓扑信息,学习高质量图结构与表示。具体地,提出新颖的GSL模块,从原始图结构中提取任务相关拓扑信息并生成拓扑嵌入,用于构建具有平滑信号的新图。该两阶段框架将邻接矩阵优化与节点表征学习解耦,有效降低内存消耗。随后,表示学习模块以新图输入,学习下游任务嵌入。ToGRL还采用提示调优策略,更好利用已学表示知识,提升对下游任务的适应性。在五个真实数据集上的大量实验表明,ToGRL显著优于当前最优方法。

原文摘要 · Abstract (English)

Real-world heterogeneous graphs are inherently noisy and usually not in the optimal graph structures for downstream tasks, which often adversely affects the performance of GRL models in downstream tasks. Although Graph Structure Learning (GSL) methods have been proposed to learn graph structures and downstream tasks simultaneously, existing methods are predominantly designed for homogeneous graphs, while GSL for heterogeneous graphs remains largely unexplored. Two challenges arise in this context. Firstly, the quality of the input graph structure has a more profound impact on GNN-based heterogeneous GRL models compared to their homogeneous counterparts. Secondly, most existing homogenous GRL models encounter memory consumption issues when applied directly to heterogeneous graphs. In this paper, we propose a novel Graph Topology learning Enhanced Heterogeneous Graph Representation Learning framework (ToGRL).ToGRL learns high-quality graph structures and representations for downstream tasks by incorporating task-relevant latent topology information. Specifically, a novel GSL module is first proposed to extract downstream task-related topology information from a raw graph structure and project it into topology embeddings. These embeddings are utilized to construct a new graph with smooth graph signals. This two-stage approach to GSL separates the optimization of the adjacency matrix from node representation learning to reduce memory consumption. Following this, a representation learning module takes the new graph as input to learn embeddings for downstream tasks. ToGRL also leverages prompt tuning to better utilize the knowledge embedded in learned representations, thus enhancing adaptability to downstream tasks. Extensive experiments on five real-world datasets show that our ToGRL outperforms state-of-the-art methods by a large margin.

异构图图结构学习表示学习提示调优

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