Recurrent In-Context Learning for Tabular Foundation Models
Not on the map. Why?
Abstract (arXiv)
Tabular foundation models adapt to new datasets through in-context learning (ICL), and, like most transformers, they tie computational depth to the number of independently parameterized layers. We ask whether the ICL stage of such a model needs a distinct set of parameters for every layer, or only depth. We introduce Tab-Loop, which replaces the 12 untied ICL blocks of TabICLv2 with 4 tied blocks applied k times and changes nothing else: the encoders, decoder, synthetic prior and training recipe are shared with an untied baseline trained for the same compute. At matched pretraining compute (18.2 EFLOP) and matched inference compute (12 block applications), Tab-Loop matches the baseline with 62% fewer parameters (10.4M vs. 27.6M): held-out log loss is 0.4583 vs. 0.4588, mean accuracy on 200 TALENT datasets is 84.10% vs. 83.92%, and Elo on 38 TabArena datasets is 1409 vs. 1396. A 4-block untied control with Tab-Loop's parameter count, which sees 32% more training tables for the same compute, trails both (83.46%; Elo 1343). Because weights are shared, depth becomes a choice made at inference. Accuracy rises with the number of loops through the trained range and holds beyond it, and continued training with deeper loops extends the useful range, reaching the baseline's stage-2 scores at 4--5× its inference compute. At this scale, the ICL stage of a tabular foundation model needs depth more than it needs distinct parameters.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 35 references that are in the map. First posted on arXiv 10 Oct 2026.
Builds on
29 of 35 references.
References · 29
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2022Transformers learn in-context by gradient descentcited by 732
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
- 2018Universal Transformerscited by 647
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 415
- 2025TabICL: A Tabular Foundation Model for In-Context Learning on Large Datacited by 289
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
- 2023Looped Transformers as Programmable Computerscited by 237
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
- 2025TabArena: A Living Benchmark for Machine Learning on Tabular Datacited by 176
- 2021PonderNet: Learning to Pondercited by 168
17 more
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2026TabICLv2: A better, faster, scalable, and open tabular foundation modelcited by 144
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
- 2021Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networkscited by 117
- 2021Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learningcited by 113
- 2024TabDPT: Scaling Tabular Foundation Models on Real Datacited by 113
- 2024Looped Transformers for Length Generalizationcited by 99
- 2025LimiX: Unleashing Structured-Data Modeling Capability for Generalist Intelligencecited by 79
- 2024Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRAcited by 78
- 2025Mitra: Mixed Synthetic Priors for Enhancing Tabular Foundation Modelscited by 77
- 2026A Mechanistic Analysis of Looped Reasoning Language Modelscited by 33
- 2025Early Stopping Tabular In-Context Learningcited by 12
- 2026Is One Layer Enough? Understanding Inference Dynamics in Tabular Foundation Modelscited by 10
- 2026TabSwift: An Efficient Tabular Foundation Model with Row-Wise Attentioncited by 8
- 2026TabFM: A Zero-Shot Foundation Model for Tabular Datacited by 6
- 2026TACTICL: Task-Aware Compression of Tabular ICL Modelscited by 4
- 2026Gated Recurrent Transformers: Expressive Depth through Recurrent Modulationcited by 4
Built on by
Not cited yet.