arXiv Computation and Language By Yingnan Chen, Chun Ding, Tianshi Xu, Xu Yang, Si Wu

SPOC-SQL: Stage-wise Preference Optimization for Controllable Text-to-SQL

Read the original on arXiv Computation and Language →

SPOC-SQL introduces a stage-wise approach to Text-to-SQL, breaking the task into four sequential subtasks aligned with standard SQL execution logic. It applies fine-grained preference optimization at key decision points and a structured decomposition strategy, enabling explicit intermediate representations for stage-wise intervention and correction. The method yields more controllable and reliable SQL generation, with experiments showing that incorporating stage-wise human knowledge consistently improves performance.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Sep 4

Reflect-SQL: A Self-Reflection Based Framework for Text-to-SQL

Reflect‑SQL is a new framework for converting natural language into SQL queries. It tackles challenges such as large, obscure database schemas, poor table and column retrieval, and syntactically or logically flawed SQL by using a multi‑stage self‑reflection approach. The system iteratively refines queries and SQL through feedback loops driven by an LLM‑as‑a‑judge, achieving 72.03% execution accuracy on the BIRD benchmark, outperforming existing baselines.

By Anupreksha Jain, Manish Shrivastava
arXiv AI
Sep 2

Replacing Training with Memory: Listwise Selection for Text-to-SQL

The paper proposes a fine‑tuning‑free listwise selector for Text‑to‑SQL systems that replaces traditional learning objectives with inference‑time strategies. It introduces reusable structured memories (MaP‑SQL) that encode mappings from natural language to schema elements, SQL operations, and expected outputs, and uses these memories to evaluate candidate queries. To reduce positional bias, the method aggregates rankings across multiple input permutations, optimizing inference cost through execution results and pointwise scoring. The approach achieves higher selection accuracy, fewer unnecessary comparisons, and outperforms the prior state‑of‑the‑art R^3‑SQL on the BIRD‑dev benchmark while using fewer tokens.

By Yeonseok Jeong, Soyoung Yoon, Seongjun Lee, Seung-won Hwang