- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper focuses on adapting tabular foundation models (TFMs) for use for link prediction. This is due to the success of TFMs for node classification and regression tasks. However, existing models aren't adapted to the task of link prediction. As such, the authors of this work introduce TFMLinker, a TFM specifically designed for link prediction. It works by sampling K local samples and learning K' global prototypes for use in ICL. For a new query (i.e., link to be predicted), the query is encoded via DRNL along with a few local heuristics (the same is done for the K local samples). Then, the query, local, and global context are then rearranged as a table for use by the TFM which is trained to correctly predict the query link given the IC samples. The authors test the generalization capbilities of their method on multiple datasets showing some improvement over baselines.
Critical strengths
-
The motivation of this paper is good as existing GFMs either don't work for link prediction or heavily rely on LLMs (or textual features).
-
The paper is well written and very easy to follow.
-
The results are generally good.
Critical weaknesses
-
There is little novelty compared to UniLP. Both frameworks: (a) sample K positive and negative pairs; (b) encode each via DRNL; (c) perform ICL. The big difference in the inclusion of a: (a) global context; (b) heuristics; (c) TFM. However, as noted in Weakness 4, the global context seems to be limited in impact. As such, the real difference lies in the use of a TFM and heuristics which is really not much of a difference and is more of a design choice in my opinion.
-
The authors don't consider the common datasets used for link prediction. Specifically, the common datasets used for link prediction are the OGB datasets [3], including ogbl-collab, ogbl-ddi, ogbl-ppa, and ogbl-citation2. However, none of these are used for the main experiments (See Q4 for a question on the ogbl-citation2 results in the appendix). I find this odd, as these datasets are the most realistic and accepted datasets for link prediction. To give an example why this matters, the train/valid/test splits for the datasets used in this study are randomly split (as per UniLP). However, this is clearly not realistic in most settings, where there is a clear pattern to different splits. E.g., the links in the ogbl-ppa datasets are biologicaly split. Furthermore, the datasets used are very small (the biggest evaluation dataset has ~22K nodes per Table 4). Real-world datasets are typically large (e.g., ogbl-ppa has ~576K nodes). As such, it's unclear to me how realistic the current setting is, raising some concerns on my end.
-
Multiple strong baselines are not included in the GNN-based section. This includes [1] (which the authors cite) and [2]. I recommend including them to get the most accurate assessment.
-
The ablation study seems to contradict the inclusion of a design settings. This includes the (a) global context, (b) GNN pre-train, (c) heuristics. Per Table 2, removing these components result in no statistically significant difference in performance, once accounting for the variance. The authors should seriously considers thew consequences of this, especially in regards to the performance w/o the global context which is a key part of their framework.
[1] "Lpformer: An adaptive graph transformer for link prediction." KDD 2024.
[2] "OCN: Effectively Utilizing Higher-Order Common Neighbors for Better Link Prediction." NeurIPS 2025.
[3] "Open graph benchmark: Datasets for machine learning on graphs." NeurIPS 2020.
Questions for authors
- Can you please clarify the novelty of the work? Specifically compared to UniLP? (Weakness 1)
- Would it be possible to test on one of the OGB datasets (Weakness 2)? For reference, ogbl-collab is the smallest.
- Could you include other baselines methods? (Weakness 3)
- Can you explain why the results for other models are so low for ogbl-citation2 in Table 5? For example the authors report a performance of 24.79 for NCNC which contradicts both the original paper [1] and subsequent replication [2].
[1] "Neural Common Neighbor with Completion for Link Prediction." ICLR 2024.
[2] "Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking." NeurIPS 2023.
5 comments
As we approach the end of the discussion period, we'd like to follow up to confirm if you have any additional questions regarding our responses. We're more than happy to provide further clarification and would greatly appreciate any other feedback you may have. Thank you for your valuable time and engagement throughout the review and rebuttal process.
Thanks for you reply. It partially addresses some of my concerns. However, I still have issues with the novelty and ablation. I expound below:
Novelty vs. UniLP
I understand it's the first TFM adapted for link prediction. However, it is still quite similar to UniLP. The authors highlight several modules they introduced, including a prototype-augmented local–global context, and a multi-domain link encoder. However the encoder uses DRNL just like UniLP. Furthermore, I'm not convinced the use of heuristics and global context is necessary (see my comment later in this reply). So my concerns wrt to the novelty still stand.
Missing OGB datasets. Missing Baselines
Thank you. I recommend including this in your revised manuscript.
Ablation
I don't think comparing the mean across 7 datasets is necessarily informative. How do you compute the t-test here? It needs to be done on the individual datasets.
Comparing against the heuristics, my back of the envelope calculations are that the increase is only statistically significant on 3/7 datasets. For the global context, it looks like only 1/7 datasets (CS). So my concerns still stand.
citation2
Thanks for the clarification. My apologies for missing it.
Thanks for your constructive comments and here are detailed responses.
Thanks. We would like to clarify that, compared to UniLP, our novelty lies a new multi-domain LP formulation centered on TFM. TFMs are pretrained on diverse synthetic datasets sampled from structural causal models and make predictions by in-context learning. They have already shown strong performance on node classification [2] and graph anomaly detection [3]. To our knowledge, this is the first adaptation of TFMs to link prediction. Based on this motivation, we introduce several tailored modules: a prototype-augmented local–global context, and a multi-domain link encoder that injects topology. Relative to UniLP’s context, our prototype-augmented local–global context keeps graph-specific local demonstrations while adding shared learnable prototypes as a compact global context. This lets our method capture both target-graph patterns and cross-graph transferable link-prediction patterns, where UniLP’s purely local attention context cannot explicitly model them. We would revise our paper to further clarify these points.
Thanks. Following your suggestion, we add results in ogbl-collab. The dataset uses the official split and the metric is Hit@50. TFMLinker achieves the highest metric. We will include the experimental results and analysis in the manuscript. More experiments on larger-scale graphs are left as important future works.
Thanks. Following your suggestion, we add LPFormer [4] and OCN [5]. The results show that TFMLinker greatly outperforms these methods.
Thanks. We respectively clarify that removing any of these components consistently hurts in terms of the overall performance across all seven datasets: removing global context leads to 2.29 a drop (71.52→69.23), removing GNN pre-train leads to 1.64 drop (71.52→69.88), removing heuristics leads to 0.85 drop (71.52→70.67). All these differences are statistically significant under a one-sided paired t-test at the 99% confidence level. Since our goal is universal multi-domain link prediction, the average over diverse datasets is the primary evaluation criterion. Fluctuations on individual datasets under reported variance do not contradict the usefulness of these components under this multi-domain average.
Thanks. We respectively clarify that the difference comes from different settings: NCNC follows the supervised setting, where we follow UniLP [1] and evaluate under a pretrain then fine-tune protocol. Specifically, baselines are pretrained on the UniLP source graphs and then fine-tuned on the target dataset, rather than trained from scratch. This setting is substantially harder than the original OGB evaluation protocol, so many GNN4LP methods that excel in the supervised setting drop significantly in this setting. In contrast, TFMLinker adapts via in-context learning without target-graph fine-tuning and still reaches high MRR, highlighting its advantage for mutli-domain link prediction under the pretrain then finetune setting.
[1] Universal Link Predictor By In-Context Learning on Graphs. TMLR'25.
[2] Turning Tabular Foundation Models into Graph Foundation Models. GFM@ICML'26.
[3] Tabular foundation models are strong graph anomaly detectors. WWW'26.
[4] LPFormer: An Adaptive Graph Transformer for Link Prediction. KDD'24.
[5] OCN: Effectively Utilizing Higher-Order Common Neighbors for Better Link Prediction. NeurIPS'25