Test-Time Verification for Text-to-SQL via Outcome Reward Models
Summary
本文提出GradeSQL框架,使用结果奖励模型(ORM)进行Text-to-SQL的测试时验证,在BIRD和Spider基准上分别比基于执行的Best-of-N方法提升4.33%和2.10%。
View Cached Full Text
Cached at: 07/01/26, 05:31 AM
# Test-Time Verification for Text-to-SQL via Outcome Reward Models Source: [https://arxiv.org/abs/2606.30851](https://arxiv.org/abs/2606.30851) [View PDF](https://arxiv.org/pdf/2606.30851) > Abstract:Improving the reliability of large language models \(LLMs\) at inference time is a central challenge in structured reasoning tasks such as Text\-to\-SQL\. Common test\-time inference strategies, including Best\-of\-N sampling and Majority Voting, rely on heuristic signals such as execution success or output frequency, which provide limited semantic discrimination across candidate outputs\. In this work, we study Outcome Reward Models \(ORMs\) as learned semantic scoring functions for test\-time verification in Text\-to\-SQL\. While ORMs have been previously explored for test\-time scaling and alignment, their application to structured query generation remains underexplored\. We introduce GradeSQL, a scalable framework for training task\-specific ORMs via automated candidate generation and execution\-based labeling, enabling verifier training without manual annotation\. We integrate ORMs into a verification\-driven Best\-of\-N pipeline and evaluate our approach on the BIRD and Spider benchmarks across multiple open\-source LLM families\. ORM\-based selection consistently outperforms execution\-based Best\-of\-N and Majority Voting, with gains of up to \+4\.33% on BIRD and \+2\.10% on Spider\. We further show that ORMs scale effectively with larger candidate sets and yield stronger improvements on complex queries\. Overall, our results demonstrate that ORM\-based verification provides a simple, effective, and scalable alternative to heuristic test\-time selection strategies for Text\-to\-SQL\. Code datasets and models are publicly available\. ## Submission history From: Gaetano Rossiello \[[view email](https://arxiv.org/show-email/f1527b76/2606.30851)\] **\[v1\]**Mon, 29 Jun 2026 19:31:39 UTC \(263 KB\)
Similar Articles
Progress-SQL: Improving Reinforcement Learning for Text-to-SQL via Progressive Rewards
Progress-SQL introduces a multi-turn reinforcement learning framework with progressive rewards for Text-to-SQL, using an Oracle-guided Diagnostic Tree to provide dense reward signals and improve SQL query generation on benchmarks like BIRD and Spider.
Putting Task Expertise into RL Achieves State-of-the-Art Performance on Text-to-SQL (18 minute read)
The article describes a reinforcement learning method with verifiable rewards to fine-tune AI models for text-to-SQL, achieving human-level accuracy on the BIRD benchmark without scaffolding.
Integrating Reasoning and Generalization in Text-to-SQL via Self-Enhanced Fine-Tuning
This paper proposes CoTE-SQL, a self-enhanced fine-tuning framework for text-to-SQL that integrates self-reasoning traces, structured chain-of-thought prompting, and execution feedback to achieve state-of-the-art performance on Spider and Bird benchmarks.
TraceSQL: Traceable Answerability Estimation for Reference-Free Text-to-SQL Verification
The paper proposes TraceSQL, a lightweight and traceable verification model for text-to-SQL systems that uses explicit diagnostic features to estimate answerability without reference queries, achieving improved performance over existing baselines on the BIRD benchmark.
R^3-SQL: Ranking Reward and Resampling for Text-to-SQL
# Paper page - R^3-SQL: Ranking Reward and Resampling for Text-to-SQL Source: [https://huggingface.co/papers/2604.25325](https://huggingface.co/papers/2604.25325) ## Abstract R$^3$\-SQL addresses inconsistencies in scoring functionally equivalent SQL queries and improves candidate recall through unified reward ranking and agentic resampling techniques\. Modern[Text\-to\-SQL](https://huggingface.co/papers?q=Text-to-SQL)systems generate multiple candidate[SQL queries](https://huggingface.co/papers