TFMLinker: Multi-Domain Link Predictor by Graph In-Context Learning with Tabular Foundation Models
Abstract
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 multi-domain link prediction methods across datasets becomes a key problem, with some initial attempts adopting Graph Foundation Models (GFMs) utilizing Graph Neural Networks (GNNs) and Large Language Models (LLMs). 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 multi-domain 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 multi-domain 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 7 graph benchmarks spanning diverse domains show that TFMLinker achieves the best average Hits@50 and ranks first on five datasets, without dataset-specific gradient-based fine-tuning.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.