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

TFMLinker:通过基于图的上下文学习进行通用链接预测的通用链接预测器

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

Nankai University(南开大学);Tsinghua University(清华大学);Beihang University(北航)

Tianyin Liao, Chunyu Hu, Yicheng Sui, Xingxuan Zhang, Peng Cui, Jianxin Li, Ziwei Zhang

AI总结:

TFMLinker通过表格基础模型的上下文学习能力,在不同图上进行通用链接预测,无需数据集特定微调。

摘要:

链接预测是图机器学习中的基础任务,广泛应用于推荐系统、药物发现、知识图谱等领域。在基础模型时代,如何开发跨数据集和领域的通用链接预测方法成为关键问题,一些初步尝试采用了利用图神经网络和大型语言模型的图基础模型。然而,现有方法面临显著的限制,包括预训练规模有限或对文本信息依赖过重。受表格基础模型(TFMs)在跨多样表格数据集实现通用预测的成功启发,我们探索了一种替代方法,即通过TFMs进行链接预测,这些模型在多样化的合成数据集上进行预训练,这些数据集采样自结构因果模型,并支持强大的上下文学习能力,独立于文本属性。然而,将TFMs应用于链接预测面临严峻的技术挑战,例如如何获取必要的上下文和捕捉以链接为中心的拓扑信息。为了解决这些挑战,我们提出了TFMLinker(表格基础模型链接预测器),旨在利用TFMs的上下文学习能力,在不同图上进行链接预测,而无需数据集特定的微调。具体来说,我们首先开发了一个原型增强的局部-全局上下文模块,以构建能够捕捉图特定和跨图可转移模式的上下文。接下来,我们设计了一个通用拓扑感知链接编码器,以捕捉以链接为中心的拓扑信息,并生成链接表示作为TFM的输入。最后,我们利用TFM通过上下文学习来预测链接的存在。在六个跨不同领域的图基准测试中,实验表明我们的方法在不需数据集特定微调的情况下优于最先进的基线。

英文摘要:

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.

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

↑