arXiv Machine Learning
TAFFY: A Task-Adaptive Tabular Foundation Model with In-Context Diversity
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
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.
Hugging Face Trending Papers
Aug 18
Understanding the Surprising Generalization Properties of Tabular Foundation Models
The paper investigates how Tabular Foundation Models (TFMs) can achieve strong transfer learning by self‑supervised pre‑training on a single real table, rather than large synthetic or real datasets. It finds that a table’s usefulness for downstream tasks is mainly determined by the number of features, not instances, and that fine‑grained column‑level preprocessing improves performance while dataset‑level filtering does not. The authors propose a task‑centric, retrieval‑based view of in‑context generalization, suggesting that effective TFMs identify and aggregate relevant examples from the provided context.
arXiv Machine Learning
Aug 19
Understanding the Surprising Generalization Properties of Tabular Foundation Models
The paper investigates how Tabular Foundation Models (TFMs) can achieve strong transfer learning by self‑supervised pre‑training on a single real table. It finds that a table’s usefulness is largely determined by its number of features rather than instances, and that fine‑grained column‑level preprocessing improves downstream performance while dataset‑level filtering does not. The authors propose that tabular in‑context generalization is primarily retrieval‑based, with models learning to identify and aggregate relevant examples from the provided context.
arXiv Machine Learning
Aug 31
SOMTab: Set-Order Mamba for Efficient Tabular In-Context Learning
SOMTab is a Set-Order Mamba architecture designed for efficient tabular in-context learning. It separates representation construction from query-conditioned retrieval, using Mamba-based state‑space mixing to build compact row and column representations while retaining attention for final prediction. The model, along with a synthetic prior called DCH‑TailMix, achieves performance comparable to Transformer‑based tabular foundation models but with faster inference and lower GPU memory usage.
arXiv AI
Sep 10
From Synthetic Priors to Model Behavior: Structural Coverage in Tabular Foundation Models
The paper investigates how synthetic pretraining priors used in tabular foundation models (TFMs) influence downstream performance. By reconstructing the synthetic data generators of four TFMs and comparing their generated tasks to two popular tabular benchmarks using structural descriptors, the authors measure structural coverage and normalized density. They find that some generators provide broader and denser support for benchmark tasks, and that stronger synthetic-to-benchmark support generally correlates with better model performance.
arXiv Machine Learning
Sep 24
A Foundation Model for Instruction-Conditioned In-Context Time Series Tasks
The paper introduces iAmTime, a time‑series foundation model that uses instruction‑conditioned in‑context learning to adapt to tasks at inference time. iAmTime represents each episode as a structured prompt with semantic tokens that focus on specific time‑series regions, enabling the model to infer task structure from input‑output demonstrations. Trained on large real and synthetic corpora across forecasting, imputation, reconstruction, classification, anomaly detection, and source de‑mixing, iAmTime outperforms strong baselines on zero‑shot probabilistic and point forecasting while matching or exceeding performance on several non‑forecasting tasks.