Methods › General › Deep Tabular Learning › TABPFN

tabular data Prior-data Fitted Network

TABPFN

26 papers tagged archive 2025-07-28

Introduced by Noah Hollmann et al. in TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

We present TabPFN, a trained Transformer that can do supervised classification for small tabular datasets in less than a second, needs no hyperparameter tuning and is competitive with state-of-the-art classification methods. TabPFN is fully entailed in the weights of our network, which accepts training and test samples as a set-valued input and yields predictions for the entire test set in a single forward pass. TabPFN is a Prior-Data Fitted Network (PFN) and is trained offline once, to approximate Bayesian inference on synthetic datasets drawn from our prior. This prior incorporates ideas from causal reasoning: It entails a large space of structural causal models with a preference for simple structures. On the 18 datasets in the OpenML-CC18 suite that contain up to 1 000 training data points, up to 100 purely numerical features without missing values, and up to 10 classes, we show that our method clearly outperforms boosted trees and performs on par with complex state-of-the-art AutoML systems with up to 230× speedup. This increases to a 5 700× speedup when using a GPU. We also validate these results on an additional 67 small numerical datasets from OpenML. We provide all our code, the trained TabPFN, an interactive browser demo and a Colab notebook at https://github.com/automl/TabPFN.

PaperSource

In Syntology about another paper, arXiv:2608.30337: no code under this name (no_code; paper_only). The lookup matched 'TabPFN' ignoring case. About another paper: this answer is about arXiv:2608.30337, while the archive credits arXiv:2207.01848, so it does not say whether this method has code.

From the lookup's note on this name: The same name also belongs to the paper “TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second” (arXiv:2207.01848, 912 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name. For arXiv:2207.01848: its page on this site · ask the lookup about it.

Origin paper of this answer, arXiv:2608.30337 (its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 26 · with a code link: 12 · where Syntology ran a sample: 9 (9 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (9 of 26 tagged: 9 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 26 of 26, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 44 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
In-Context Learning16
tabular-classification6
AutoML3
Bayesian Inference3
Meta-Learning3
Transfer Learning3
Classification2
Language Modeling2
Language Modelling2
Prompt Engineering2
Retrieval2
feature selection2
All1
Computational Efficiency1
Data Augmentation1
Data Valuation1
Deep Learning1
Denoising1
Density Estimation1
Disease Prediction1

Usage over time archive 2025-07-28

Papers per year tagged with TABPFN: 2022 to 2025, peak 13 13 0 2022: 1 paper 2022 2023: 3 papers 2023 2024: 13 papers 2024 2025: 9 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (26 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Deep Tabular Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections