Skip to content

Understanding the Surprising Generalization Properties of Tabular Foundation Models

Aug 2026 · 1 citation · 35 references
Computer Science

TL;DR

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.

Abstract

Tabular Foundation Models (TFMs) increasingly rely on in-context learning, where a model receives labelled examples at inference time and predicts labels for new inputs without updating its weights. Existing TFMs are typically trained on either massive synthetic corpora or very large collections of real datasets. In contrast, we show that surprisingly strong transfer can emerge from self-supervised pre-training on just a single real table. In this setting, we also find that tables tend to be either broadly useful or broadly poor regardless of downstream prediction task, and that the strongest predictor of usefulness is the number of features rather than the number of instances. This leads to a task-centric interpretation of tabular pre-training: the number and the quality of tasks are essential for the pre-training of TFMs. We show that the same task-centric perspective can help corpus design at scale: fine-grained column-level pre-processing consistently improves downstream performance, while no improvements are observed when we filter or deduplicate at the dataset level. Finally, we offer a new perspective for how TFMs generalize: we believe 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. The mechanics of TFMs have been relatively understudied; our task-centric, retrieval-based perspective offers a new framework to guide future model and corpus design.

View source

Similar papers

Preprint Aug 2026

Why Large Language Models Fail at Tabular Prediction

The results show that the LLM's capability dissolves with dimension in a way no noise-corrupted classical learner mimics - which explains why LLMs, so capable elsewhere, keep losing to fifty-year-old baselines on tables, while leaving the mechanism of the prediction as an open question.

M. Garnelo, Wojciech M. Czarnecki · 1 citation
Review Open access Aug 2026

The Current Generation of Tabular Foundation Models: A Critical Review

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, and summarises openness and deployment.

Sergei O. Kurashkin, V. Tynchenko, Alexey S. Borodulin et al. · 0 citations
Preprint Aug 2026

Do Tabular Foundation Models Agree with Themselves?

This work proposes asking a different question: could a model's predictions result from any joint distribution?

Christian Klötergens, Vijaya Krishna Yalavarthi, Lars Schmidt-Thieme et al. · 2 citations
Preprint Aug 2026

TabDPT-Turbo: Efficient In-Context Learning for Tabular Prediction

This work adopts an alternate approach, sticking with row-based attention while incorporating long context pre-training to eliminate the need for retrieval in TabDPT-Turbo, a model that provides comparable default performance to TabDPT v1.1 on TabArena-Lite, CC18, and CTR23, at orders of magnitude faster.

Rasa Hosseinzadeh, Alex Labach, Zexin Xue et al. · 2 citations
Book Open access Jul 2026

Prior-Data Fitted Networks as Tabular Foundation Models for Ranking in Low-Data Settings

This work demonstrates that PFNs, which are originally trained for classification, successfully outperform classification baselines on ranking data and introduces a novel sampling and inference scheme to obtain pairwise predictions from PFNs' native pointwise architecture, analogous to pairwise LTR.

David Vos, Samarth Bhargav, M. D. Rijke et al. · 0 citations
Preprint Aug 2026

MIL-BERT: Classification of Arbitrarily Large Text with Performance and Explanatory Guarantees

Many text classification decisions are viable based on constituent excerpts alone. Taking inspiration from the field of multiple instance learning, we present an algorithm for training a neural network to classify text by selecting such excerpts. We show that our approach is also scalable with demonstrated learning against samples with nearly 1M tokens. We evaluate our methods on 7 datasets with emphasis on long-textual collections that far exceed the encoding limit of our base model. We present state-of-the-art results with this algorithm on 3 datasets: identification of political bias in news outlets, trigger warnings in long stories, and demographic characteristics of authors in tweet collections. Furthermore, the model trained on weakly-labeled collections of text (bags) generalizes to accurately classify constituent, smaller instances. Besides a new state-of-the-art for these problems, this approach is one of the few neural methods to excel in these datasets.

John J. Cadigan, Dayne Freitag, Eric Yeh · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.