On hard multi-table text-to-SQL, verification-based LLM judges beat self-consistency and log-probability for predicting execution correctness, and fine-tuned verifiers fail to transfer across schemas.
Nature , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2representative citing papers
Derives a closed-form impossibility bound and feasibility test for conformal risk control on structured LLM outputs, with empirical comparison of bounds and adaptive inference across models and tasks.
citing papers explorer
-
What Predicts Correctness in Text-to-SQL? A Selective-Prediction Study
On hard multi-table text-to-SQL, verification-based LLM judges beat self-consistency and log-probability for predicting execution correctness, and fine-tuned verifiers fail to transfer across schemas.
-
When Can Conformal Risk Control Certify LLM Outputs? Bounds, Impossibility, and Adaptation for Structured Generation
Derives a closed-form impossibility bound and feasibility test for conformal risk control on structured LLM outputs, with empirical comparison of bounds and adaptive inference across models and tasks.