The reviewed record of science sign in
Pith

arxiv: 2402.11137 · v3 · pith:ZT5OIHXD · submitted 2024-02-17 · cs.LG

TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZT5OIHXDrecord.jsonopen to challenge →

classification cs.LG
keywords pfnstunetablesdatasetsperformancecontextachievesfittedlarge
0
0 comments X
read the original abstract

While tabular classification has traditionally relied on from-scratch training, a recent breakthrough called prior-data fitted networks (PFNs) challenges this approach. Similar to large language models, PFNs make use of pretraining and in-context learning to achieve strong performance on new tasks in a single forward pass. However, current PFNs have limitations that prohibit their widespread adoption. Notably, TabPFN achieves very strong performance on small tabular datasets but is not designed to make predictions for datasets of size larger than 1000. In this work, we overcome these limitations and substantially improve the performance of PFNs via context optimization. We introduce TuneTables, a parameter-efficient fine-tuning strategy for PFNs that compresses large datasets into a smaller learned context. We conduct extensive experiments on 19 algorithms over 98 datasets and find that TuneTables achieves the best performance on average, outperforming boosted trees such as CatBoost, while optimizing fewer than 5% of TabPFN's parameters. Furthermore, we show that TuneTables can be used as an interpretability tool and can even be used to mitigate biases by optimizing a fairness objective. We open-source our code and raw results at https://github.com/penfever/TuneTables.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. CRUMB: Efficient Prior Fitted Network Inference via Distributionally Matched Context Batching

    cs.LG 2026-06 unverdicted novelty 6.0

    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 architec...

  2. Testing for Single-Population Ancestry in the Admixture Model

    stat.ME 2026-06 unverdicted novelty 6.0

    A new constrained parametric bootstrap test for single-population ancestry in the supervised admixture model, proven to have asymptotic level alpha and consistency.

  3. TabICL: A Tabular Foundation Model for In-Context Learning on Large Data

    cs.LG 2025-02 unverdicted novelty 6.0

    TabICL scales in-context learning to large tabular data via column-then-row attention for row embeddings followed by a transformer, matching TabPFNv2 speed and performance while outperforming it and CatBoost on datase...