arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.22984cs.LGcs.AIcs.SI
收藏

图基础模型能否在架构上泛化?

Can Graph Foundation Models Generalize Over Architecture?

University of Oxford(牛津大学);AITHYRA

Benjamin Gutteridge, Michael Bronstein, Xiaowen Dong

AI总结:

本文探讨图基础模型在架构适应性上的必要性,指出现有模型在任务依赖的架构属性上缺乏鲁棒性,并提出一种能适应任务特定线性图运算的框架,实现跨异构架构的零样本泛化。

摘要:

图基础模型(GFMs)最近因其图神经网络(GNN)架构在任意规模、特征维度和领域上的零样本泛化潜力而受到关注。尽管现有工作在多样化的现实世界基准上展示了这种能力,但这些任务存在一个关键隐藏限制:它们只允许有限有效的GNN架构。特别是,当前无领域GFMs依赖固定架构骨干,隐含假设单一消息传递模式足以跨任务。本文认为架构适应性是真正GFMs的必要条件。我们证明现有方法在任务依赖的架构属性上非鲁棒,并以范围为最小且可测量的轴,展示这一限制的显性。通过理论分析和受控合成实验,我们证明固定骨干GFMs在与训练时见过的架构要求不同的任务上确实表现不足。为解决此问题,我们引入一个框架,在推理时适应有效的GNN架构,通过发现和混合任务特定的线性图运算符,实现跨异构架构的零样本泛化,而无需重新训练。我们在任意范围合成任务和一系列现实世界基准上验证了我们的方法,展示了在现有无领域GFMs上的性能和鲁棒性提升。

英文摘要:

Graph foundation models (GFMs) have recently attracted interest due to the promise of graph neural network (GNN) architectures that generalize zero-shot across graphs of arbitrary scales, feature dimensions, and domains. While existing work has demonstrated this ability empirically across diverse real-world benchmarks, these tasks share a crucial hidden limitation: they admit a narrow set of effective GNN architectures. In particular, current domain-agnostic GFMs rely on fixed architectural backbones, implicitly assuming that a single message-passing regime suffices across tasks. In this paper, we argue that architecture adaptivity is a necessary requirement for true GFMs. We show that existing approaches are non-robust to task-dependent architectural attributes and, as a case study, use range as a minimal and measurable axis along which this limitation becomes explicit. With theoretical analysis and controlled synthetic experiments, we demonstrate that fixed-backbone GFMs provably under-reach on tasks whose architectural requirements differ from those seen at training time. To address this issue, we introduce a framework that adapts effective GNN architecture at inference time by discovering and mixing task-specific linear graph operators, enabling zero-shot generalization across tasks with heterogeneous architectural requirements, without retraining. We validate our approach on arbitrary-range synthetic tasks and a suite of real-world benchmarks, demonstrating improved performance and robustness over existing domain-agnostic GFMs.

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

↑