Pocket Foundation Models: Distilling TFMs into CPU-Ready Gradient-Boosted Trees
On the map: Knowledge distillation → General knowledge distillation methods
Abstract (arXiv)
A fraud scorer needs to answer in under 2 ms. The best tabular foundation models (TFMs) take 151-1,275 ms on GPU. We close this gap by distilling the TFM offline into an XGBoost or CatBoost student that runs natively on CPU. The central obstacle is specific to in-context learning (ICL) teachers: they leak labels when scoring their own training set, so the soft targets collapse to near-one-hot vectors with no inter-class structure left to distill. Stratified out-of-fold (OOF) teacher labeling prevents this. Across 153 classification datasets drawn from TALENT, OpenML-CC18, TabZilla, and TabArena, distilling TabICLv2 into XGBoost gives 0.882 macro-mean AUC (96.5% of teacher AUC) at 1.9 ms on CPU, a 38x to 860x speedup across teacher-student pairs with a statistically significant edge over a tuned CatBoost baseline (Wilcoxon p = 0.0008; 51% win rate). Four further findings: teacher rank transfers exactly to student rank; gains concentrate on low-dimensional data (< 21 features: +0.011 over CatBoost vs. >21 features: +0.001); multi-teacher averaging helps MLP students (+0.006, p = 0.003) but adds less than 0.001 for tree students; and on high-dimensional tasks where the teacher itself trails CatBoost, distillation makes things worse rather than better. The full pipeline is open-sourced as part of the TabTune library.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Placed in General knowledge distillation methods, one of 12 directions in Knowledge distillation. Builds on 20 of its 32 references that are in the map. First posted on arXiv 18 May 2026.
Builds on
20 of 32 references.
References · 20
- 2015Distilling the Knowledge in a Neural Networkcited by 10,180
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,143
- 2017On Calibration of Modern Neural Networkscited by 4,902
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 652
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 645
- 2018Born Again Neural Networkscited by 541
- 2013Do Deep Nets Really Need to be Deep?cited by 471
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 219
- 2022Why do tree-based models still outperform deep learning on tabular data?cited by 198
- 2017OpenML Benchmarking Suitescited by 173
- 2025TabArena: A Living Benchmark for Machine Learning on Tabular Datacited by 159
- 2026TabICLv2: A better, faster, scalable, and open tabular foundation modelcited by 124
8 more
- 2025TabPFN-2.5: Advancing the State of the Art in Tabular Foundation Modelscited by 121
- 2024TabDPT: Scaling Tabular Foundation Models on Real Datacited by 101
- 2025LimiX: Unleashing Structured-Data Modeling Capability for Generalist Intelligencecited by 69
- 2025Orion-MSP: Multi-Scale Sparse Attention for Tabular In-Context Learningcited by 17
- 2025Dataset distillation for memorized data: Soft labels can leak held-out teacher knowledgecited by 10
- 2025TabTune: A Unified Library for Inference and Fine-Tuning Tabular Foundation Modelscited by 10
- 2025Orion-Bix: Bi-Axial Attention for Tabular In-Context Learningcited by 8
- 2024Data Laundering: Artificially Boosting Benchmark Results through Knowledge Distillationcited by 6
Built on by
Citing papers per year: 2026: 2.
2 papers.