arXiv:2606.03307cs.IRcs.AI2026-06KDD

用双曲空间增强图模型的外部知识检索,提升跨域泛化能力。

Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation

论文配图:Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation
图 1 · 摘自论文原文
  • 在双曲空间构建知识索引,更好保留树状知识结构。
  • 多粒度检索实现全局语义与局部细节的精准获取。
  • 适合需要强泛化能力的图神经网络下游任务。

图基础模型(GFMs)通过大规模预训练实现了跨领域推理,但其参数化知识难以应对分布偏移,限制了泛化能力。现有基于欧氏空间的检索增强生成(RAG)框架因几何不匹配,导致检索时语义粒度丢失并产生枢纽现象。为此,本文提出双曲检索增强生成(HyRAG)框架:通过双曲知识索引模块在双曲空间中建模外部知识库的树状层次结构;多粒度检索模块分别提供粗粒度全局语义锚点与细粒度局部语义细节;双路径融合模块在特征与结构层面实现知识有效整合。在多个图基准数据集上的实验表明,该方法在零样本设置下显著提升性能,验证了其对鲁棒图模型推理的泛化优势。

原文摘要 · Abstract (English)

Graph foundation models (GFMs) emerged as a dominant paradigm in graph representation learning by leveraging large-scale pre-training for cross-domain inference. However, the parameterized knowledge encoded within these models is insufficient to cope with distribution shifts, limiting their generalization ability. To mitigate this issue, retrieval-augmented generation (RAG) has been introduced to incorporate external knowledge at inference time. Nevertheless, existing RAG frameworks operating in Euclidean space suffer from a fundamental geometric limitation: the polynomial volume growth of Euclidean space is inherently mismatched with the tree-structured external knowledge bases. This mismatch leads to the loss of semantic granularity in retrieval and gives rise to the hubness phenomenon.To address this limitation, we propose a Hyperbolic Retrieval-Augmented Generation (HyRAG) framework designed to enhance the generalization capabilities of GFMs. Specifically, the introduced Hyperbolic Knowledge Indexing module retains the tree-like hierarchies of the external knowledge base by modeling them within hyperbolic space. The Multi-granularity Retrieval module then provides GFMs with the global semantic anchors and local semantic nuances through coarse-grained and fine-grained knowledge retrieval, respectively. Finally, the Dual-path Fusion module achieves effective knowledge integration for graph tasks at both the feature and structural levels. Experiments on multiple graph benchmarks demonstrate significant improvements in the zero-shot setting, highlighting the generalization of our method for robust GFMs inference.

图神经网络知识检索双曲空间

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