Back to AI News
arxiv

Active In-Context Learning for Tabular Foundation Models: When, Where, How

This paper studies active in-context learning for tabular foundation models (TFMs), where labels are acquired iteratively to build the context. The authors propose and evaluate target-aware and information-gain-based acquisition rules against classical methods across twenty benchmarks. Key findings show that diversity-based acquisition works best early, target-aware nearest-neighbor selection is crucial, and the EPIC rule retains 80-87% of full-data performance with only 5-10% of the pool labeled.

AI Brief

Provides concrete guidance on label-efficient strategies for tabular foundation models, a practical concern for real-world deployment.

arXiv:2611.07886v1 Announce Type: cross Abstract: Tabular Foundation Models (TFMs) adapt to a new task only through the labeled rows in their context. However, labels are expensive to acquire in real-world scenarios due to the need for highly specific domain knowledge to ensure high-quality data. Active in-context learning transfers classical acquisition rules to this setting, in which the model that guides acquisition changes with every label added. We ask how the value of diversity, predictive uncertainty and target-aware information gain changes as a frozen TFM acquires more context. For that, we study Target-Aware Nearest Neighbor (TANN) acquisition and the Expected Predictive Information Gain in Context (EPIC) and evaluate them against classical rules. Our study across twenty benchmarks with two well-established TFMs and classical GBDTs highlights three findings: (i) When: diversity-based acquisition is best during the first acquisition iterations; (ii) Where: labeling pool rows that serve the target inputs via a simple target-aware nearest-neighbor rule matters substantially; (iii) How: EPIC yields the best models at the label budget, retains on average 80--87% of the chance-corrected full-data performance with only 5-10% of the pool labeled on the eight benchmarks with the largest pools, and selects labels that also improve the predictive performance of gradient-boosted decision trees.
Be the first to rate this article.

Comments & Questions (0)

Captcha
Please be respectful — let's keep the conversation friendly.

No comments yet

Be the first to comment!