TabPFN-3: Technical Report

arXiv cs.LG Papers

Summary

TabPFN-3 is a new foundation model for tabular data, pretrained on synthetic data, that scales to 1M training rows while reducing training and inference time, achieving state-of-the-art performance on tabular prediction, time series, and relational data.

arXiv:2605.13986v1 Announce Type: new Abstract: 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.
Original Article
View Cached Full Text

Cached at: 05/15/26, 06:26 AM

# TabPFN-3: Technical Report
Source: [https://arxiv.org/abs/2605.13986](https://arxiv.org/abs/2605.13986)
Authors:[Léo Grinsztajn](https://arxiv.org/search/cs?searchtype=author&query=Grinsztajn,+L),[Klemens Flöge](https://arxiv.org/search/cs?searchtype=author&query=Fl%C3%B6ge,+K),[Oscar Key](https://arxiv.org/search/cs?searchtype=author&query=Key,+O),[Felix Birkel](https://arxiv.org/search/cs?searchtype=author&query=Birkel,+F),[Philipp Jund](https://arxiv.org/search/cs?searchtype=author&query=Jund,+P),[Brendan Roof](https://arxiv.org/search/cs?searchtype=author&query=Roof,+B),[Mihir Manium](https://arxiv.org/search/cs?searchtype=author&query=Manium,+M),[Shi Bin](https://arxiv.org/search/cs?searchtype=author&query=Bin,+S)\(Liam\)Hoo,[Magnus Bühler](https://arxiv.org/search/cs?searchtype=author&query=B%C3%BChler,+M),[Anurag Garg](https://arxiv.org/search/cs?searchtype=author&query=Garg,+A),[Dominik Safaric](https://arxiv.org/search/cs?searchtype=author&query=Safaric,+D),[Jake Robertson](https://arxiv.org/search/cs?searchtype=author&query=Robertson,+J),[Benjamin Jäger](https://arxiv.org/search/cs?searchtype=author&query=J%C3%A4ger,+B),[Simone Alessi](https://arxiv.org/search/cs?searchtype=author&query=Alessi,+S),[Adrian Hayler](https://arxiv.org/search/cs?searchtype=author&query=Hayler,+A),[Vladyslav Moroshan](https://arxiv.org/search/cs?searchtype=author&query=Moroshan,+V),[Lennart Purucker](https://arxiv.org/search/cs?searchtype=author&query=Purucker,+L),[Philipp Singer](https://arxiv.org/search/cs?searchtype=author&query=Singer,+P),[Alan Arazi](https://arxiv.org/search/cs?searchtype=author&query=Arazi,+A),[Julien Siems](https://arxiv.org/search/cs?searchtype=author&query=Siems,+J),[Jan Hendrik Metzen](https://arxiv.org/search/cs?searchtype=author&query=Metzen,+J+H),[Georg Grab](https://arxiv.org/search/cs?searchtype=author&query=Grab,+G),[Nick Erickson](https://arxiv.org/search/cs?searchtype=author&query=Erickson,+N),[Siyuan Guo](https://arxiv.org/search/cs?searchtype=author&query=Guo,+S),[Eliott Kalfon](https://arxiv.org/search/cs?searchtype=author&query=Kalfon,+E),[Simon Bing](https://arxiv.org/search/cs?searchtype=author&query=Bing,+S),[David Salinas](https://arxiv.org/search/cs?searchtype=author&query=Salinas,+D),[Clara Cornu](https://arxiv.org/search/cs?searchtype=author&query=Cornu,+C),[Lilly Charlotte Wehrhahn](https://arxiv.org/search/cs?searchtype=author&query=Wehrhahn,+L+C),[Diana Kriuchkova](https://arxiv.org/search/cs?searchtype=author&query=Kriuchkova,+D),[Kursat Kaya](https://arxiv.org/search/cs?searchtype=author&query=Kaya,+K),[Lydia Sidhoum](https://arxiv.org/search/cs?searchtype=author&query=Sidhoum,+L),[Marie Salmon](https://arxiv.org/search/cs?searchtype=author&query=Salmon,+M),[Jerry Chen](https://arxiv.org/search/cs?searchtype=author&query=Chen,+J),[Madelon Hulsebos](https://arxiv.org/search/cs?searchtype=author&query=Hulsebos,+M),[Yann LeCun](https://arxiv.org/search/cs?searchtype=author&query=LeCun,+Y),[Samuel Müller](https://arxiv.org/search/cs?searchtype=author&query=M%C3%BCller,+S),[Bernhard Schölkopf](https://arxiv.org/search/cs?searchtype=author&query=Sch%C3%B6lkopf,+B),[Sauraj Gambhir](https://arxiv.org/search/cs?searchtype=author&query=Gambhir,+S),[Noah Hollmann](https://arxiv.org/search/cs?searchtype=author&query=Hollmann,+N),[Frank Hutter](https://arxiv.org/search/cs?searchtype=author&query=Hutter,+F)

[View PDF](https://arxiv.org/pdf/2605.13986)

> Abstract: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\.

## Submission history

From: Léo Grinsztajn \[[view email](https://arxiv.org/show-email/a28b4712/2605.13986)\] **\[v1\]**Wed, 13 May 2026 18:01:43 UTC \(4,428 KB\)

Similar Articles

PriorLabs/TabPFN

GitHub Trending (daily)

TabPFN is introduced as a foundation model specifically designed for tabular data by PriorLabs.

When Tabular Foundation Models Meet Strategic Tabular Data: A Prior Alignment Approach

arXiv cs.AI

This paper studies whether tabular foundation models based on pretrained prior-data fitted networks (PFNs) can generalize to strategic tabular data where individuals modify features after deployment. It proposes Strategic Prior-data Fitted Network (SPN), an inference-time framework that aligns PFN predictions with the post-manipulation distribution without retraining.