arXiv:2602.08592cs.LG2026-02被引 3

用表格大模型实现无需微调的通用链接预测。

TFMLinker: Universal Link Predictor by Graph In-Context Learning with Tabular Foundation Models

  • 基于表格大模型的上下文学习,构建跨图通用预测框架。
  • 在6个不同领域图数据集上超越现有方法,无需特定数据微调。
  • 适合需要快速适配新图数据的推荐与知识图谱场景。

链接预测是图机器学习中的基础任务,广泛应用于推荐系统、药物发现、知识图谱等领域。在基础模型时代,如何在不同数据集和领域间实现通用链接预测成为关键问题。现有方法多依赖图神经网络或大语言模型,但存在预训练规模有限或过度依赖文本信息等问题。受表格基础模型(TFMs)在跨多样化表格数据上实现通用预测成功的启发,本文探索将TFM用于链接预测的新路径。TFMs在结构因果模型生成的合成数据上预训练,具备不依赖文本属性的强上下文学习能力。然而将其应用于链接预测面临两大挑战:如何获取有效上下文,以及如何捕捉以链接为中心的拓扑信息。为此,本文提出TFMLinker,利用TFM的上下文学习能力,在无需数据集微调的前提下实现跨图链接预测。具体地,设计原型增强的局部-全局上下文模块,融合图内特性和跨图可迁移模式;提出通用拓扑感知链接编码器,生成链接表示输入到TFM;最终通过上下文学习预测链接存在性。在6个跨领域图基准上的实验表明,该方法显著优于现有最先进基线。

原文摘要 · Abstract (English)

Link prediction is a fundamental task in graph machine learning with widespread applications such as recommendation systems, drug discovery, knowledge graphs, etc. In the foundation model era, how to develop universal link prediction methods across datasets and domains becomes a key problem, with some initial attempts adopting Graph Foundation Models utilizing Graph Neural Networks and Large Language Models. However, the existing methods face notable limitations, including limited pre-training scale or heavy reliance on textual information. Motivated by the success of tabular foundation models (TFMs) in achieving universal prediction across diverse tabular datasets, we explore an alternative approach by TFMs, which are pre-trained on diverse synthetic datasets sampled from structural causal models and support strong in-context learning independent of textual attributes. Nevertheless, adapting TFMs for link prediction faces severe technical challenges such as how to obtain the necessary context and capture link-centric topological information. To solve these challenges, we propose TFMLinker (Tabular Foundation Model for Link Predictor), aiming to leverage the in-context learning capabilities of TFMs to perform link prediction across diverse graphs without requiring dataset-specific fine-tuning. Specifically, we first develop a prototype-augmented local-global context module to construct context that captures both graph-specific and cross-graph transferable patterns. Next, we design a universal topology-aware link encoder to capture link-centric topological information and generate link representations as inputs for the TFM. Finally, we employ the TFM to predict link existence through in-context learning. Experiments on 6 graph benchmarks across diverse domains demonstrate the superiority of our method over state-of-the-art baselines without requiring dataset-specific finetuning.

链接预测表格模型上下文学习图神经网络

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