CRUMB speeds up PFN inference on large tabular datasets by clustering queries and selecting MMD-matched context subsets, outperforming prior selection methods on the 51-dataset TabArena benchmark across three architectures while handling covariate drift.
Tabpfn-wide: Continued pre-training for extreme feature counts
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LG 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
TabPFN-3 scales tabular foundation models to 1M rows with synthetic pretraining, test-time compute, and benchmark-leading performance on tabular, relational, and tabular-text tasks while being up to 20x faster than TabPFN-2.5.
VIP-COP is a black-box method that optimizes context for tabular foundation models by ranking and selecting high-value samples and features via online KernelSHAP regression, outperforming baselines on large high-dimensional data.
citing papers explorer
-
CRUMB: Efficient Prior Fitted Network Inference via Distributionally Matched Context Batching
CRUMB speeds up PFN inference on large tabular datasets by clustering queries and selecting MMD-matched context subsets, outperforming prior selection methods on the 51-dataset TabArena benchmark across three architectures while handling covariate drift.
-
TabPFN-3: Technical Report
TabPFN-3 scales tabular foundation models to 1M rows with synthetic pretraining, test-time compute, and benchmark-leading performance on tabular, relational, and tabular-text tasks while being up to 20x faster than TabPFN-2.5.
-
VIP-COP: Context Optimization for Tabular Foundation Models
VIP-COP is a black-box method that optimizes context for tabular foundation models by ranking and selecting high-value samples and features via online KernelSHAP regression, outperforming baselines on large high-dimensional data.