aiqbench analysis
This paper addresses the computational bottleneck in tabular foundation models by introducing k-NN retrieval, which drastically reduces inference costs without requiring architectural changes. The approach retains near-state-of-the-art accuracy while achieving up to 249x speedup for single-query serving scenarios on large datasets. This advancement is critical for deploying efficient AI systems that handle massive tabular information effectively.
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. However, full-context tabular ICL still suffers from attention cost that grows with the training-context size, which limits its ability to handle large datasets efficiently. Localized TabICLv2 introduces a method that reduces the inference cost of TabICLv2 by retrieving only the k nearest training neighbours for each test point, measured by similarity in the model's Stage 2 row-representation space, rather than using the full training context. This requires no architectural changes, and we show that accuracy retention can be improved through additional Stage 2 and Stage 3 fine-tuning. On TabArena classification tasks, the fine-tuned localized model retains 98.64% of Full TabICLv2 accuracy and it achieves a median 2.18$\times$ speedup in batch inference, and reaches approximately 249$\times$ median speedup in the single-query serving setting.
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. However, full-context tabular ICL still suffers from attention cost that grows with the training-context size, which limits its ability to handle large datasets efficiently. Localized TabICLv2 introduces a method that reduces the inference cost of TabICLv2 by retrieving only the k nearest training neighbours for each test point, measured by similarity in the model's Stage 2 row-representation space, rather than using the full training context. This requires no architectural changes, and we show that accuracy retention can be improved through additional Stage 2 and Stage 3 fine-tuning. On TabArena classification tasks, the fine-tuned localized model retains 98.64% of Full TabICLv2 accuracy and it achieves a median 2.18$\times$ speedup in batch inference, and reaches approximately 249$\times$ median speedup in the single-query serving setting.
Machine Learning (cs.LG)
arXiv:2608.16429 [cs.LG]
(or arXiv:2608.16429v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.16429 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 238 words
Related coverage

NVIDIA Releases Kumo Tabular: Open Tabular Foundation Models That Predict New Rows in a Single Forward Pass
MarkTechPost · Oct 1, 2026
LoGIC: Budgeted Context Construction for Node-Level Graph In-Context Learning with Tabular Foundation Models
arXiv · Sep 9, 2026
Dual-Scale Relational Graph Transformers for Ecosystem-Aware Fraud Detection
arXiv · Oct 7, 2026
TabICLv2: A better, faster, scalable, and open tabular foundation model
arXiv · Sep 17, 2026