TabPFN-3: Technical Report
Not on the map. Why?
Abstract (arXiv)
Tabular data underpins most high-value prediction problems in science and industry, and TabPFN has driven the foundation model revolution for this modality. Designed with feedback from our users, TabPFN-3 builds on this foundation to scale state-of-the-art performance to datasets with 1M training rows and substantially reduce training and inference time. Pretrained exclusively on synthetic data from our prior, TabPFN-3 dramatically pushes the frontier of tabular prediction and brings substantial gains on time series, relational, and tabular-text data. On the standard tabular benchmark TabArena, a forward pass of TabPFN-3 outperforms all other models, including tuned and ensembled baselines, by a significant margin, and pareto-dominates the speed/performance frontier. On more diverse datasets, TabPFN-3 ranks first on datasets with many classes, and beats 8-hour-tuned gradient-boosted-tree baselines on datasets up to 1M training rows and 200 features. TabPFN-3 introduces test-time compute scaling to tabular foundation models. Our API offering TabPFN-3-Plus (Thinking) exploits this to beat all non-TabPFN models by over 200 Elo on TabArena, rising to 420 Elo on the largest data subset, and outperforms AutoGluon 1.5 extreme while being 10x faster, without using LLMs, real data, internet search or any other model besides TabPFN. TabPFN-3 extends the capabilities of our models, enabling SOTA prediction on relational data (new SOTA foundation model on RelBenchV1) and tabular-text data (SOTA on TabSTAR via TabPFN-3-Plus); and improves existing integrations: a specialized checkpoint, TabPFN-TS-3, ranks 2nd on the time-series benchmark fev-bench, and SHAP-value computation is up to 120x faster. TabPFN-3 achieves this performance while being up to 20x faster than TabPFN-2.5. In addition, a reduced KV cache and row-chunking scale to 1M rows on one H100 with fast inference speed.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 May 2026.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Efficient Provably Private Classification with a Tabular Foundation Modelcited by 0
- 2026Estimating Uncoded Crash Factors with Tabular Foundation and System One Models: Kumo Tabular and Jevcited by 0
- 2026MotherTree: Meta-learning on synthetic data improves decision tree trainingcited by 0
- 2026Test-Time Compute for Tabular Foundation Models: Mechanisms, Gains, and Limitscited by 0
- 2026Test-Time Compute for Tabular Foundation Models: Mechanisms, Gains, and Limits8 Oct 2026
- 2026MotherTree: Meta-learning on synthetic data improves decision tree training7 Oct 2026
- 2026Estimating Uncoded Crash Factors with Tabular Foundation and System One Models: Kumo Tabular and Jev7 Oct 2026
- 2026Efficient Provably Private Classification with a Tabular Foundation Model7 Oct 2026
Similar, not cited
Close in wording, no citation either way
- 2026TabPFN-3.5: Technical Report
- 2026TabSwift: An Efficient Tabular Foundation Model with Row-Wise Attention
- 2026Xiaomi-TabLDM: A Tabular Foundation Model Technical Report
- 2025On Finetuning Tabular Foundation Models
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second
- 2026Distillation of Tabular Foundation Models into Efficient Predictors
- 2026Balanced Adaptive Prototype Selection for Scalable TabPFN Inference on Large-Scale Tabular Data
- 2024TabDPT: Scaling Tabular Foundation Models on Real Data