Can Graphs Improve Tabular Foundation Models?
Franck Le, Keith Grueneberg, Erich Nahum, Vadim Sheinin

TL;DR
This paper explores whether adding simple graph priors can improve pretrained tabular transformers, demonstrating that a lightweight bipartite graph approach enhances performance across numerous datasets.
Contribution
Introduces BOLERO, a lightweight bipartite graph module that augments pretrained tabular transformers with minimal complexity, improving their predictive accuracy.
Findings
BOLERO achieves the highest number of statistically significant wins.
Graph priors improve performance across classification and regression tasks.
Lightweight graph augmentation enhances pretrained models without retraining.
Abstract
Tabular data are central to many real-world systems. While recent tabular transformers and in-context learners such as SAINT, TP-BERTa, TabPFN, TabICL, and MITRA incorporate limited inter-row reasoning, most approaches still lack an explicit mechanism to model relationships among instances, even though similar samples often share related outcomes. We investigate whether introducing \emph{simple graph priors} can enhance \emph{pretrained tabular transformers}. Concretely, we introduce {BOLERO}, a lightweight, static bipartite graph head that augments {RoBERTa-Tab} (a RoBERTa-style tabular backbone pretrained with masked-token prediction.) Each instance connects to feature/value anchors; a small GNN refines row representations, while the backbone remains frozen. We evaluate on 80 classification and 64 regression datasets from the TP-BERTa benchmark suites, comparing against strong…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Explainable Artificial Intelligence (XAI) · Domain Adaptation and Few-Shot Learning
