Robust Active Learning for Few-Shot Example Selection in Text-to-SQL
This work proposes a stratified greedy algorithm that maximizes a heteroscedastic information-gain objective and proves that the objective is monotone and submodular under query-dependent noise, so stratified greedy selection carries a 1/2-approximation guarantee under the partition constraint.