This first release of Prior Labs in relational learning shows our continued commitment to open science. We open-source three pieces of software that we expect to accelerate research in the field towards meaningful real-world impact.
arXiv:2607. 29129v1 Announce Type: new Abstract: Relational Foundation Models (RFMs) require large-scale synthetic relational databases for pretraining, but existing approaches tightly couple data generation with the model training pipeline.
By Mohammad Sadeq Abolhasani, Viswanath Ganapathy
arXiv:2609.01292v1 Announce Type: cross
Abstract: Relational Deep Learning (RDL) has become a powerful paradigm for learning from multi-tabular data. However, manually defining RDL prediction tasks i...
By Oleksii Kolesnichenko, Jakub Pele\v{s}ka, Gustav \v{S}\'{\i}r
arXiv:2601.13111v3 Announce Type: replace-cross
Abstract: Realistic text-to-SQL workflows often require joining multiple tables. As a result, accurately retrieving the relevant set of tables becomes...
By Hassan Soliman, Vivek Gupta, Dan Roth, Iryna Gurevych
arXiv:2607. 03659v1 Announce Type: cross Abstract: Relational databases (RDBs) are the primary data infrastructure in many enterprises, yet recent deep learning methods designed for RDBs have been evaluated under inconsistent experimental protocols, making fair comparison difficult.
By Kazi F. Akhter, Bharath Ajendla, Manar D. Samad
RelICL: Training-free Relational Learning with Tabular Foundation Models proposes a new method for relational learning that addresses two key issues of deep feature synthesis—feature explosion and interaction blindness—by propagating and fusing information step by step through the schema graph using a tabular foundation model. The approach retains the benefits of DFS while improving scalability and performance. Experiments on RelBench tasks show that RelICL performs on par with the strongest DFS-based approach.
By Simon Forbat, Rainer Gemulla
arXiv:2510. 18428v4 Announce Type: replace Abstract: Optimization modeling underlies critical decision-making across industries, yet remains difficult to automate: natural-language problem descriptions must be translated into precise mathematical formulations and executable solver code.
By Minwei Kong, Ao Qu, Xiaotong Guo, Wenbin Ouyang, Chonghe Jiang, Han Zheng, Yining Ma, Dingyi Zhuang, Yuhan Tang, Junyi Li, Shenhao Wang, Haris Koutsopoulos, Hai Wang, Cathy Wu, Jinhua Zhao
arXiv:2604. 12176v2 Announce Type: replace Abstract: Relational reasoning is the ability to infer relations that jointly bind multiple entities, attributes, or variables.
By Lukas Fesser, Yasha Ektefaie, Ada Fang, Sham M. Kakade, Marinka Zitnik
arXiv:2602. 04029v2 Announce Type: replace-cross Abstract: Relational Foundation Models (RFMs) facilitate data-driven decision-making by learning from complex multi-table databases.
By Vignesh Kothapalli, Rishabh Ranjan, Valter Hudovernik, Vijay Prakash Dwivedi, Johannes Hoffart, Carlos Guestrin, Jure Leskovec
The paper introduces Open Tabular Insight Extraction (OpenTI), a unified framework aimed at democratizing access to insights from large table corpora. It highlights how current research is fragmented across domains like table QA, text‑to‑SQL, and data analysis agents, and shows that existing systems and benchmarks fall short of covering the full end‑to‑end scope of OpenTI. The authors propose a consolidated terminology, conduct a systematic review, and outline a research agenda for developing comprehensive OpenTI systems, evaluation methods, and interaction paradigms.
By Daniel Gomm, Maarten de Rijke, Madelon Hulsebos
arXiv:2603.20004v4 Announce Type: replace-cross
Abstract: Translating natural language questions to SQL queries (Text-to-SQL) is a long-standing problem in database research. Recent efforts have focu...
By Yuxuan Zhu, Tengjun Jin, Yoojin Choi, Daniel Kang
MetaRTL is a two-stage framework for relational table learning that first generates lightweight pre-trained table embeddings and then applies non‑parametric message passing to extract meta‑path features. These features are aggregated using an attention module called MetaAttn, shifting computation from deep GNN stacks to efficient meta‑path aggregation. Experiments on 10 real‑world datasets across 24 tasks show that MetaRTL achieves strong performance while reducing computational cost.
By Ken Zhong, Weichen Li, Zheng Wang