Saved in:
Bibliographic Details
Main Authors: Zhang, Yuxin, Fan, Meihao, Fan, Ju, Yi, Mingyang, Luo, Yuyu, Tan, Jian, Li, Guoliang
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.04671
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912380647112704
author Zhang, Yuxin
Fan, Meihao
Fan, Ju
Yi, Mingyang
Luo, Yuyu
Tan, Jian
Li, Guoliang
author_facet Zhang, Yuxin
Fan, Meihao
Fan, Ju
Yi, Mingyang
Luo, Yuyu
Tan, Jian
Li, Guoliang
contents Recent advances in large language models (LLMs) have significantly improved performance on the Text-to-SQL task by leveraging their powerful reasoning capabilities. To enhance accuracy during the reasoning process, external Process Reward Models (PRMs) can be introduced during training and inference to provide fine-grained supervision. However, if misused, PRMs may distort the reasoning trajectory and lead to suboptimal or incorrect SQL generation. To address this challenge, we propose Reward-SQL, a framework that systematically explores how to incorporate PRMs into the Text-to-SQL reasoning process effectively. Our approach follows a "cold start, then PRM supervision" paradigm. Specifically, we first train the model to decompose SQL queries into structured stepwise reasoning chains using common table expressions (Chain-of-CTEs), establishing a strong and interpretable reasoning baseline. Then, we investigate four strategies for integrating PRMs, and find that combining PRM as an online training signal (e.g.,GRPO) with PRM-guided inference (e.g., best-of-N sampling) yields the best results. Empirically, on the BIRD benchmark, Reward-SQL enables models supervised by PRM (7B) to achieve a 13.1% performance gain across various guidance strategies. Notably, our GRPO-aligned policy model based on Qwen2.5-Coder-7B-Instruct achieves 68.9% accuracy on the BIRD development set, outperforming all baseline methods under the same model size. These results demonstrate the effectiveness of Reward-SQL in leveraging reward-based supervision for Text-to-SQL reasoning.
format Preprint
id arxiv_https___arxiv_org_abs_2505_04671
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Reward-SQL: Boosting Text-to-SQL via Stepwise Reasoning and Process-Supervised Rewards
Zhang, Yuxin
Fan, Meihao
Fan, Ju
Yi, Mingyang
Luo, Yuyu
Tan, Jian
Li, Guoliang
Computation and Language
Machine Learning
Recent advances in large language models (LLMs) have significantly improved performance on the Text-to-SQL task by leveraging their powerful reasoning capabilities. To enhance accuracy during the reasoning process, external Process Reward Models (PRMs) can be introduced during training and inference to provide fine-grained supervision. However, if misused, PRMs may distort the reasoning trajectory and lead to suboptimal or incorrect SQL generation. To address this challenge, we propose Reward-SQL, a framework that systematically explores how to incorporate PRMs into the Text-to-SQL reasoning process effectively. Our approach follows a "cold start, then PRM supervision" paradigm. Specifically, we first train the model to decompose SQL queries into structured stepwise reasoning chains using common table expressions (Chain-of-CTEs), establishing a strong and interpretable reasoning baseline. Then, we investigate four strategies for integrating PRMs, and find that combining PRM as an online training signal (e.g.,GRPO) with PRM-guided inference (e.g., best-of-N sampling) yields the best results. Empirically, on the BIRD benchmark, Reward-SQL enables models supervised by PRM (7B) to achieve a 13.1% performance gain across various guidance strategies. Notably, our GRPO-aligned policy model based on Qwen2.5-Coder-7B-Instruct achieves 68.9% accuracy on the BIRD development set, outperforming all baseline methods under the same model size. These results demonstrate the effectiveness of Reward-SQL in leveraging reward-based supervision for Text-to-SQL reasoning.
title Reward-SQL: Boosting Text-to-SQL via Stepwise Reasoning and Process-Supervised Rewards
topic Computation and Language
Machine Learning
url https://arxiv.org/abs/2505.04671