- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates why tabular foundation models, combined with parameter-free relational encoders, can perform well on relational databases without RDB-specific pretraining. Through extensive benchmark comparisons, the authors show that TFM-based approaches such as RDBLearn and TabPFN-Rel are competitive with specialized relational foundation models. The paper provides several theoretical and empirical explanations, including the continuum between tabular and relational data, locality and approximate IID assumptions in in-context learning, the expressivity of parameter-free encoders, and their compatibility with agent-based feature engineering.
Critical strengths
- The paper investigates why tabular foundation models can generalize effectively to relational data without RDB-specific pretraining, which is a meaningful research direction.
- The authors evaluate multiple approaches across diverse relational benchmarks, providing strong empirical evidence for the competitiveness of TFM-based methods.
- The paper offers several perspectives on locality, in-context learning, encoder expressivity, and the relationship between tabular and relational data.
Critical weaknesses
- Sections 5–7 are difficult to follow. The main arguments are buried in lengthy discussions, and the connection between the theoretical claims and experiments is often unclear. Figure 3 is particularly hard to read. The paper would benefit from a more concise and structured presentation.
- Section 3 largely revisits comparisons already explored in prior work, including RelAgent and KumoRFM2. While the broader benchmark coverage is useful, it is unclear what new insights these experiments provide beyond confirming existing observations. The authors should better distinguish this evaluation from prior studies and clarify differences in experimental protocols, especially since results from different sources and model-selection procedures are combined.
- In Section 4, relational databases are constructed by splitting categorical columns of single-table datasets into lookup tables while keeping the original labels. This is quite different from real temporal RDB prediction tasks, such as rel-f1, where predictions depend on historical events, their ordering, and evolving entity states. The experiment mainly tests whether models retain single-table predictive performance after schema transformation, rather than their ability to exploit genuine relational dependencies.
- The arguments favoring uniform sampling and parameter-free encoders are stronger than what the experiments establish. For example, RT-J demonstrates substantially better performance in low-label regimes and shows that graph-aware retrieval can outperform uniform sampling. This suggests that relational pretraining may improve context efficiency, an important dimension largely overlooked here. More controlled experiments varying the number of support examples, retrieval strategy, and encoder design are needed before drawing broader conclusions about relationally pretrained models.
- The analysis in Section 5 relies heavily on approximate IID sampling and sufficient relational representations, neither of which is empirically examined. In particular, the proof of Proposition 5.2 appears to infer conditional independence between labels from the sufficiency of individual representations. This does not generally follow when samples share entities or latent factors. The authors should clarify the required assumptions and the scope of the theoretical result.
Questions for authors
Please check the questions in the weakness.
4 comments
Response to Reviewer Usdo Cont.
Comment: In Section 4, relational databases are constructed by splitting categorical columns of single-table datasets into lookup tables while keeping the original labels. This is quite different from real temporal RDB prediction tasks, such as rel-f1, where predictions depend on historical events, their ordering, and evolving entity states. The experiment mainly tests whether models retain single-table predictive performance after schema transformation, rather than their ability to exploit genuine relational dependencies.
Response: There are many diverse RDB forms, and we concede that the construction in Section 4 is only one of them. That being said, we believe that Section 4 still motivates a valid testing regime, given that single tables, as well as multi-table expansions thereof, represent viable RDB special cases not covered by current benchmarks. In this regard, the extraction of auxiliary tables (steps 1--3) introduces new cross-row relational dependencies that may be challenging or impossible (depending on setting details) for a standard TFM to capture without a relational encoder or . We also emphasize that the train/test splits we adopt in Figure 2 are explicitly temporal (non-IID), such that predictions do in fact depend on historical context as in the rel-f1 case (even if some other details may not be the same).
Regardless, we are sympathetic to the reviewer's overall point, and recognize that more diverse testing has merit. In this regard, please see our general response to all reviewers above, whereby we introduce a revision to Figure 2 as well as new experiments varying . The latter allows for interpolating relational effects from small to large.
Comment: The arguments favoring uniform sampling and parameter-free encoders are stronger than what the experiments establish. For example, RT-J demonstrates substantially better performance in low-label regimes and shows that graph-aware retrieval can outperform uniform sampling. This suggests that relational pretraining may improve context efficiency, an important dimension largely overlooked here. More controlled experiments varying the number of support examples, retrieval strategy, and encoder design are needed before drawing broader conclusions about relationally pretrained models.
Response: The reviewer's point is well noted. Please see our general response to all reviewers above, whereby we demonstrate that RDBLearn is actually simultaneously capable of achieving greater sample efficiency (on a per-task basis) and accuracy relative to RT-J. Furthermore, we show that this achievement relies on uniformly sampling a fixed context, as analyzed in Section 5, as opposed to random-walk sampling, conclusions based on new testing of these variants head-to-head for the first time in a controlled setting. And lastly, our new experiments also include varying context sizes in low-sample regimes, whereby RDBLearn still maintains a consistent advantage when granted uniform sampling. We sincerely appreciate the feedback and believe these results considerably improve our draft.
Comment: The analysis in Section 5 relies heavily on approximate IID sampling and sufficient relational representations, neither of which is empirically examined. In particular, the proof of Proposition 5.2 appears to infer conditional independence between labels from the sufficiency of individual representations. This does not generally follow when samples share entities or latent factors. The authors should clarify the required assumptions and the scope of the theoretical result.
Response: ICL samples can share entities and/or latent factors and still have conditionally independent labels provided the conditioning variables forming the context are sufficiently rich. The assumption of Proposition 5.2 is merely that our encoder has distilled available relational information about the label, such that remaining factors of variation are largely exogenous. We agree that this is an approximation, but it is one often adopted in analysis settings, including within the graph neural network literature involving analogous relational context (e.g., please see Remark 1 in Ma et al., "Subgroup Generalization and Fairness of Graph Neural Networks," NeurIPS 2021). Overall, some form of assumption like this is needed to make theoretical progress (which is mostly lacking thus far in the RDB FM space). We have included this reference in our updated draft and can try to clarify further if the reviewer feels that would be helpful. Thanks for the suggestions here.
Thanks for the response, the new experiment has solved most of my concerns and i will raise the score to 3.
Follow-up to reviewer Usdo
We put significant time into preparing the rebuttal. Thanks so much for looking into it and increasing the score, while acknowledging that the new content addressed concerns.
Response to Reviewer Usdo
We thank the reviewer for listing several strengths of our work, as well as providing a number of clearly-stated concerns. We address each of the latter below.
Comment: Sections 5–7 are difficult to follow. The main arguments are buried in lengthy discussions, and the connection between the theoretical claims and experiments is often unclear. Figure 3 is particularly hard to read. The paper would benefit from a more concise and structured presentation.
Response: We apologize for any lack of clarity, and remark that we have uploaded a new draft to openreview that may help a bit in this regard (although further improvements are still possible via reviewer feedback). We also mention that the lengthy discussion in places is a reflection of the considerable nuance and complexity of the underlying topic. With respect to Section 5–7 experiments and connections to theory, we offer the following clarification of Figure 3 (which distills all such experiments). This figure is meant to convey three main points:
Comment: Section 3 largely revisits comparisons already explored in prior work, including RelAgent and KumoRFM2. While the broader benchmark coverage is useful, it is unclear what new insights these experiments provide beyond confirming existing observations. The authors should better distinguish this evaluation from prior studies and clarify differences in experimental protocols, especially since results from different sources and model-selection procedures are combined.
Response: Neither the RelAgent nor the KumoRFM-2 paper cover the full range of comparisons we consider in Figure 1. For example, the KumoRFM-2 paper does not evaluate against any TFM-based models (our focus) outside of RelBench-v1 testing. Meanwhile, the RelAgent paper does not compare on any of the 8 SALT benchmark tasks, nor the Mimic task in RelBench-v2. Additionally, this paper does not compare against the strongest TFM-based approaches like TabPFN-Rel or the latest RDBLearn, nor several other strong RDB FMs such as RT-J, PFN-Rel, and RandGNN. Hence the coverage of RDB FMs in particular is not comprehensive in the RelAgent paper (this is somewhat expected, since RelAgent is not an FM-oriented work).
Consequently, our submission represents the first comparison specifically targeting TFM-based models (that see no RDB data during pre-training) versus non-TFM-based RDB FMs (which do see RDB data) across a broad range of benchmarking tasks. This is critical for establishing our starting premise that TFM-based approaches do indeed excel on RDB data they have never seen.