STEER: Reducing Inference Cost in Relational Foundation Models through Semantically Informed Sampling
Not on the map. Why?
Abstract (arXiv)
Relational foundation models (RFMs) are pretrained once on a collection of relational databases and prediction tasks, and then applied zero-shot to previously unseen databases and tasks. To make a prediction for a target row, an RFM samples a neighborhood of rows linked to that row through foreign keys and uses this neighborhood as its inference context. Lowering inference cost is an important goal for any foundation model, and for RFMs this cost grows with the size of the context. The simplest ways to shrink the context is to drop some of the sampled rows, but this ignores the semantics of the database schema, so it is as likely to discard informative rows as uninformative ones. We propose STEER, a sampling approach that shrinks the inference context by concentrating it on the tables most relevant to the prediction task at hand. STEER obtains relevance information by prompting a large language model to rank the foreign-key edges of the database schema into relevance tiers for the given task, and then maps each tier to a probability of following that edge during traversal. Because the ranking uses only the schema, it is computed once per task and reused across all subsequent predictions, amortizing its cost. We evaluate STEER on three state-of-the-art RFMs (RT, RT-J, and Griffin) and show that it reduces inference context size by about 40% on average while maintaining, and in some cases improving, prediction accuracy.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 38 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
22 of 38 references.
References · 22
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
- 2025TabICL: A Tabular Foundation Model for In-Context Learning on Large Datacited by 267
- 2024CodeS: Towards Building Open-source Language Models for Text-to-SQLcited by 183
- 2026TabICLv2: A better, faster, scalable, and open tabular foundation modelcited by 112
- 2024RelBench: A Benchmark for Deep Learning on Relational Databasescited by 90
- 2024Squeezed Attention: Accelerating Long Context Length LLM Inferencecited by 56
- 2025RelGNN: Composite Message Passing for Relational Deep Learningcited by 45
- 2025Relational Transformer: Toward Zero-Shot Foundation Models for Relational Datacited by 32
10 more
- 2025Large Language Models are Good Relational Learnerscited by 22
- 2024Schema Matching with Large Language Models: an Experimental Studycited by 19
- 2026RelBench v2: A Large-Scale Benchmark and Repository for Relational Datacited by 17
- 2026PluRel: Synthetic Data unlocks Scaling Laws for Relational Foundation Modelscited by 15
- 2026KumoRFM-2: Scaling Foundation Models for Relational Learningcited by 15
- 2024Tackling prediction tasks in relational databases with LLMscited by 14
- 2024Transformers Meet Relational Databasescited by 9
- 2026Predictive Query Language: A Domain-Specific Language for Predictive Modeling on Relational Databasescited by 8
- 2026No Need to Train Your RDB Foundation Modelcited by 8
- 2026An LLM-Guided Query-Aware Inference System for GNN Models on Large Knowledge Graphscited by 2
Built on by
Not cited yet.