arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.03315cs.LG
收藏

具有频谱解析和原型引导空间传播的图基础模型

SPR: Toward a Graph Foundation Model for Transferable Graph Cognition via Spectral Patterns and Relational Geometry

School of Computer Science and Technology(计算机科学与技术学院);Tianjin University(天津大学);School of Artificial Intelligence(人工智能学院);Hebei University of Technology(河北工业大学);Department of Health Technology and Informatics(健康技术与信息学院);Department of Data Science and Artificial Intelligence(数据科学与人工智能系);The Hong Kong Polytechnic University(香港理工大学)

Ankang Yang, Jitao Zhao, Dongxiao He, Liang Yang, Di Jin, Weixiong Zhang

AI总结:

提出SPG模型,通过可学习的切比雪夫滤波器分解节点特征为多个频谱响应,并利用Gromov-Wasserstein原型几何蒸馏可迁移的成对关系,实现跨域图泛化。

摘要:

图基础模型旨在从多样化的图中学习可迁移知识,以泛化到未见过的图和任务。与文本和图像不同,图缺乏共享词汇或规则的空间网格,使得跨图迁移具有挑战性。这一挑战既来自特征差异,更关键的是来自多样化的图结构。现有的GFM主要通过统一特征空间或引入结构标记和词汇来提高可迁移性。然而,现有的拓扑感知设计仍有局限性。结构标记通常是离散的,而结构词汇通常依赖于预定义的子结构(如树和环),其有限覆盖可能遗漏跨图中更丰富的关系模式。此外,图信号包含高频局部模式和更平滑的低频模式,这需要不同的传播行为。这些成分在原始图信号中通常是纠缠的,而这一频谱视角在现有GFM中很少被探索。为了解决这些挑战,我们提出了SPG,一种具有频谱解析和原型引导空间传播的图基础模型。SPG应用可学习的切比雪夫滤波器将节点特征分解为多个频谱响应,减少频率特定图信号与传播行为之间的不匹配。然后,它构建一个Gromov-Wasserstein原型几何,将超越预定义子结构的可迁移成对关系蒸馏到共享结构空间中。学习到的原型几何进一步被投影回作为原型引导的传播算子。实验表明在跨域泛化中具有一致的改进。

英文摘要:

Recently, Graph Foundation Models (GFMs) have attracted increasing attention for their potential to learn unified and generalizable knowledge across diverse graphs, thereby supporting a wide range of graph scenarios. However, unlike natural language and images, graphs lack an intuitive and unified form for perceiving and organizing transferable knowledge. Therefore, despite many initial explorations, a key problem remains unresolved: the transferable cognitive mechanism for graphs. Existing GFMs usually rely on intuitively defined mechanisms to encode transferable graph patterns, such as handcrafted structural templates (e.g., cycles and trees), fixed propagation mechanisms, and predefined random-walk patterns. These mechanisms are often prescriptive and rigid, limiting their ability to flexibly characterize diverse graph patterns across domains. This motivates the exploration of a more flexible, graph-native, and transferable cognitive mechanism. To this end, we analyze graphs from the spectral perspective and propose SPR. SPR decomposes graph information into Chebyshev polynomial bases and learns shared spectral responses, enabling unified yet adaptive cognition of continuously varying spectral patterns across graphs. We further model cross-graph relational geometry to distill recurring pairwise organization from multiple graphs, providing a shared relational reference for transferring such graph cognition across domains. Extensive experiments across diverse graphs and downstream scenarios demonstrate that SPR enables effective and transferable graph cognition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑