This work proposes asking a different question: could a model's predictions result from any joint distribution?
Abstract
Tabular Foundation Models (TFMs) are currently the best approach to tabular prediction problems. They are constructed as transformers that approximate the Bayesian posterior predictive distribution based on a pre-training prior. These univariate predictors can be converted into multivariate ones autoregressively by sampling one target and adding it to the features. However, the faithfulness of the resulting joint has not been investigated. Furthermore, TFMs cannot be evaluated against the posterior itself, at least not on real-world datasets, because the ground-truth distribution is unknown. We therefore propose asking a different question: could a model's predictions result from any joint distribution? To answer this question, we pose two requirements that any such model must satisfy. The first is marginalization consistency, which demands that marginalized conditionals are equal to directly predicted marginals. The second is factorization consistency, which demands that different factorization orders result in equal joint distributions. Every TFM that we evaluate violates both of these requirements for both classification and regression across all datasets.
A task-centric, retrieval-based perspective is offered for how TFMs generalize: it is believed that tabular in-context generalization is largely retrieval-based, and good models are those that learn to identify relevant examples in the provided context and aggregate them well.
Nour Shaheen, Junwei Ma, Alex Labach et al.· 3 citations
Existing benchmarks for OOD in tabular data are extended, providing evidence to support their adoption in high-stakes domains characterized by structural distribution shifts and identifying a scalability gap.
Malena Loza, David Chushig-Muzo, Eva Milara et al.· 0 citations
This review is, to the authors' knowledge, the first organised around the current generation of tabular foundation models, and taxonomises the architectures by pretraining regime, maps the capability space across five axes, isolates the language-model-on-tabular strand for prediction, feature engineering and generation...
S. Kurashkin, V. Tynchenko, Alexey S. Borodulin et al.· Machine Learning and Knowled...· 1 citation
Pre-trained tabular prediction models based on Prior-Data Fitted Networks (PFNs), such as TabPFN and LimiX, have achieved remarkable progress in supervised learning, demonstrating immense potential across real-world scenarios and diverse downstream tasks. However, a critical question remains systematically unexplored:...
Zheng Guan, Yikang Chen, Hao Qian et al.· Proceedings of the 32nd ACM...· 0 citations
Local distillation is proposed, in which a black-box teacher guides a regularized linear"student" model at each query point, and it is proved that this randomization yields feature-selection probabilities that are stable under small perturbations of the training responses.
P predictive Monte Carlo (PMC) is used as a general interpretability tool for any BFT: using only next-token generation, PMC returns an approximation to the implicit prior and posterior over the latent task, answering the interpretive question directly in latent space.