arXiv Machine Learning

Robust Active Learning for Few-Shot Example Selection in Text-to-SQL

arXiv:2606. 10125v1 Announce Type: cross Abstract: Few-shot example retrieval is the dominant paradigm for grounding large language models (LLMs) in domain-specific text-to-SQL systems.

arXiv Computation and Language
Aug 27

Loss-Based Active Learning for Neural Abstractive Summarization

Loss-Based Active Learning for Neural Abstractive Summarization proposes LOBSTER, an active learning framework that selects unlabeled documents similar to the model’s high‑loss training examples to correct specific weaknesses. The method is tailored for abstractive summarization, addressing instability and computational bottlenecks seen in prior work. Experiments on three benchmark datasets and two backbone models show that LOBSTER matches or surpasses state‑of‑the‑art performance while speeding up query selection by up to 665×.

By Michail Ioannou, Tatiana Passali, George Michalopoulos, Grigorios Tsoumakas
arXiv Machine Learning
Aug 20

Coordination on a Budget: Federated Active Learning with Few Labels

The paper introduces a federated active learning (FAL) approach that tackles data privacy and label scarcity by coordinating query selection across clients. In low-budget scenarios, it finds that homogeneous (IID) data actually requires stronger coordination to avoid redundant queries, while heterogeneous data naturally yields diversity—a reversal of the usual federated learning narrative. The authors propose a new framework that aligns client data in a shared embedding space via federated representation learning, enabling globally coordinated active selection while keeping annotations local, and demonstrate that this method outperforms existing FAL methods even with larger annotation budgets.

By Liam Mohr, Daphna Weinshall
arXiv AI
Jul 3

Neuron-Aware Active Few-Shot Learning for LLMs

arXiv:2607. 02423v1 Announce Type: cross Abstract: Active Few-Shot Learning (AFSL) adapts LLMs to specialized domains by identifying the most valuable unlabeled samples for annotation and use as few-shot demonstrations, effectively reducing human annotation costs while promoting high performance.

By Zhuowei Chen, Liwei Chen, Christian Schunn, Raquel Coelho, Xiang Lorraine Li
Hugging Face Trending Papers
Jul 14

Finding the Right Tables and Columns: A Benchmark and Corpus-Adaptive Embeddings for SQL Schema Retrieval

Retrieval in the SQL setting has largely been studied as the task of finding, within a large collection of SQL statements, the statement that answers a natural-language question. At scale, however, a more fundamental retrieval problem precedes generation: schema retrieval, identifying the tables and columns a question requires in a database that may contain thousands of them, far more than fit in a model's context.

arXiv AI
Sep 23

LIMIT: Less Is More for Instruction Tuning in Text-to-SQL

LIMIT (Less Is More for Instruction Tuning in Text-to-SQL) challenges the belief that large instruction corpora are necessary for effective Text-to-SQL models. The framework uses a four‑stage data‑centric process—difficulty‑aware filtering, chain‑of‑thought synthesis, LLM‑as‑judge quality scoring, and genetic algorithm optimization—to select a compact set of examples that still achieve full schema coverage. On the BIRD and Spider benchmarks, LIMIT’s 796 and 863 samples enable Qwen3‑8B to reach 69.1% and 88.9% execution accuracy, outperforming methods trained on twenty times more data and setting a new state‑of‑the‑art for open‑source approaches.

By Haoyuan Ma, Hengwei Liu, Linjuan Wu, Yongliang Shen, Weiming Lu
arXiv Machine Learning
Aug 20

Pretraining Reusable Inference Across Views with Synthetic Task Priors

The paper introduces SIMPLE, a prior‑fitted multi‑view in‑context learner that learns a reusable, task‑conditioned inference procedure instead of a fixed fusion function. By generating synthetic task priors in embedding space, SIMPLE can handle diverse view configurations, class structures, and missingness patterns. Experiments on multi‑view and multi‑omics benchmarks show that a frozen SIMPLE model performs competitively, and lightweight adapter calibration further improves performance across most datasets.

By Jielong Lu, Zhihao Wu, Jiajun Yu, Zhaoliang Chen, Haishuai Wang
arXiv Computation and Language
Aug 27

Align Then Adapt: Label-Efficient Adapter Learning for Asymmetric Dense Retrieval

The paper introduces Efficient Retrieval Adapter (ERA), a query‑side adapter framework that enables dense retrieval systems to adapt to asymmetric query–document scenarios without re‑indexing. ERA first aligns the embedding spaces of a powerful query embedder and a lightweight document embedder using unlabeled documents, then fine‑tunes the aligned query representation with a small set of labeled query‑document pairs. In experiments on 126 MAIR retrieval tasks across six domains, ERA boosts average nDCG@10 by up to 8.2 points in symmetric settings and over 12 points in asymmetric settings while requiring far fewer labels than fully supervised adapter training.

By Seiji Maekawa, Moin Aminnaseri, Pouya Pezeshkpour, Estevam Hruschka
arXiv Computation and Language
6d ago

Large Language Model Selection with Limited Annotations

arXiv:2605.24981v2 Announce Type: replace Abstract: Choosing a Large Language Model (LLM) for a given task requires comparing many strong candidates, yet standard evaluation relies on costly annotati...

By Yavuz Durmazkeser, Patrik Okanovic, Andreas Kirsch, Torsten Hoefler, Nezihe Merve G\"urel