arXiv AI
Recurrent In-Context Learning for Tabular Foundation Models
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Oct 9
Test-Time Compute for Tabular Foundation Models: Mechanisms, Gains, and Limits
The paper investigates how test‑time compute techniques—adaptation, aggregation, and context construction—can improve predictions of pretrained tabular foundation models (TFMs). It introduces DiagScale, a lightweight adaptation method that trains a minuscule fraction of parameters yet matches full fine‑tuning gains, and shows that selective aggregation of predictions from diverse preprocessing variants can reduce error, while broader context expansion offers inconsistent benefits. The study concludes that adaptation and selective aggregation consistently yield benchmark‑level improvements, but their combined use demands more computation, guiding strategy selection based on available resources.
arXiv Machine Learning
Sep 24
What Do Tabular Foundation Models Compute In Context? In-Situ Representation Refinement through Attention-Gated Updates
The paper introduces RefineICL, an attention‑gated, feed‑forward‑network‑free framework that refines representations in situ for tabular foundation models. By using support labels to guide episode‑specific updates, the method transfers learned corrections to unlabeled queries without altering model parameters, achieving state‑of‑the‑art performance on AMLB29 and TabArena benchmarks. Experiments and internal interventions demonstrate that intermediate support updates are essential for constructing task‑specific predictors in context.
arXiv Machine Learning
4d ago
When Does Depth Help? Understanding Layerwise Inference in Tabular Foundation Models
arXiv:2610.19814v1 Announce Type: new Abstract: Transformer-based tabular foundation models (TFMs) achieve state-of-the-art performance on small to medium-sized tabular prediction tasks while process...
arXiv Machine Learning
Oct 8
Thinking in Depth: Retrospective Inference for Tabular Foundation Models
The paper introduces Retro, a tabular foundation model that uses retrospective inference to revisit and recombine intermediate representations during inference. Retro employs Attention Residuals to select which past information to reuse and query-conditioned Gated Attention to shape the contextual update for each query. Experiments on TabArena, TALENT, and RelArena show Retro achieves top‑three performance and lies on the Pareto frontier, demonstrating that reusing intermediate representations can better exploit depth in tabular foundation models.
arXiv Machine Learning
Aug 18
Localized TabICLv2: Scaling Tabular In-Context Learning through k-NN
arXiv:2608. 16429v1 Announce Type: new Abstract: Foundational models for tabular data have made significant progress in recent years, with TabICLv2 reporting state-of-the-art performance on several tabular classification tasks.
arXiv AI
Oct 12
Tabular Foundation Models Are Effectively Shallow
The paper shows that Tabular Foundation Models (TFMs) are highly overparameterized, with up to 96% of transformer blocks removable without significant loss in performance. Using a closed‑form, label‑free affine translator, the authors demonstrate that halving the depth of eight leading TFMs costs at most $0.002$ median AUROC, while a single‑block TabPFN‑3 remains competitive. Removing depth saves up to 1.5 B parameters, speeds GPU inference up to 6×, and reduces memory usage by 6× with negligible accuracy loss.