REVIEW 6 cited by
OmniSQL: Synthesizing High-quality Text-to-SQL Data at Scale
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Text-to-SQL, the task of translating natural language questions into SQL queries, plays a crucial role in enabling non-experts to interact with databases. While recent advancements in large language models (LLMs) have significantly enhanced text-to-SQL performance, existing approaches face notable limitations in real-world text-to-SQL applications. Prompting-based methods often depend on closed-source LLMs, which are expensive, raise privacy concerns, and lack customization. Fine-tuning-based methods, on the other hand, suffer from poor generalizability due to the limited coverage of publicly available training data. To overcome these challenges, we propose a novel and scalable text-to-SQL data synthesis framework for automatically synthesizing large-scale, high-quality, and diverse datasets without extensive human intervention. Using this framework, we introduce SynSQL-2.5M, the first million-scale text-to-SQL dataset, containing 2.5 million samples spanning over 16,000 synthetic databases. Each sample includes a database, SQL query, natural language question, and chain-of-thought (CoT) solution. Leveraging SynSQL-2.5M, we develop OmniSQL, a powerful open-source text-to-SQL model available in three sizes: 7B, 14B, and 32B. Extensive evaluations across nine datasets demonstrate that OmniSQL achieves state-of-the-art performance, matching or surpassing leading closed-source and open-source LLMs, including GPT-4o and DeepSeek-V3, despite its smaller size. We release all code, datasets, and models to support further research.
Forward citations
Cited by 6 Pith papers
-
Beyond Static Rules: Automated Discovery of Latent Vulnerabilities in Text-to-SQL
An evolving Vulnerability Codex plus hypothesis-driven perturbations exposes latent Text-to-SQL failures in LLMs far better than fixed expert rules, with transferable patterns and early remediation gains.
-
Non-vacuous Generalization Bounds for Reinforcement Learning with Verifiable Rewards
Non-vacuous PAC-Bayes generalization bounds for billion-parameter RLVR models, obtained by a Gumbel-max reparameterization and aggressive TinyLoRA distillation/quantization, are claimed for four tasks.
-
EcoTable: Cost-effective Table Integration in Data Lakes for Natural Language Queries
Query-driven table integration that uses Steiner-tree search to choose which joins LLMs must verify, reporting 30%+ accuracy gains at 5x lower LLM cost.
-
PaVeRL-SQL: Text-to-SQL via Partial-Match Rewards and Verbal Reinforcement Learning
PaVeRL-SQL reports SOTA execution accuracy on Spider2.0-SQLite using partial-match rewards and verbal RL, but overclaims SOTA on Spider and BIRD.
-
LogicCat: A Chain-of-Thought Text-to-SQL Benchmark for Complex Reasoning
The authors built a 4,038-question text-to-SQL benchmark with chain-of-thought annotations and found that state-of-the-art models reach only 33.20% execution accuracy.
-
CogniSQL-R1-Zero: Lightweight Reinforced Reasoning for Efficient SQL Generation
A 7B model trained with GRPO and a sparse execution-correctness reward reaches 59.97% execution accuracy on BIRD dev, though the evaluation protocol and baseline numbers contain inconsistencies.
Discussion (0). Sign in to comment.