The reviewed record of science sign in
Pith

arxiv: 2305.14907 · v3 · pith:TYNWPCHV · submitted 2023-05-24 · cs.CL

Coverage-based Example Selection for In-Context Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TYNWPCHVrecord.jsonopen to challenge →

classification cs.CL
keywords examplesin-contextselectiontasksaspectsbetterexamplelearning
0
0 comments X
read the original abstract

In-context learning (ICL), the ability of large language models to perform novel tasks by conditioning on a prompt with a few task examples, requires these examples to be informative about the test instance. The standard approach of independently ranking and selecting the most similar examples selects redundant examples while omitting important information. In this work, we show that BERTScore-Recall (BSR) selects better examples that demonstrate more of the salient aspects, e.g. reasoning patterns, of the test input. We further extend BSR and many standard metrics to easily optimizable set-level metrics, giving still better coverage of those salient aspects. On 15 datasets spanning 6 tasks and with 7 diverse LLMs, we show that (1) BSR is the superior metric for in-context example selection across the board, and (2) for compositional tasks, set selection using Set-BSR outperforms independent ranking by up to 17 points on average and, despite being training-free, surpasses methods that leverage task or LLM-specific training.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. UCS: Estimating Unseen Coverage for Improved In-Context Learning

    cs.LG 2026-04 unverdicted novelty 6.0

    UCS estimates the number of unrevealed latent clusters in candidate demonstration sets via Smoothed Good-Turing on embeddings to improve ICL performance by 2-6% when added to baselines.

  2. GRAIN: Group Aggregation via Min-Norm Objective

    cs.LG 2026-06 unverdicted novelty 5.0

    GRAIN is a gradient aggregation method using min-norm objectives to ensure non-negative inner products with group gradients, yielding tighter uniform stability bounds than SGD under smoothness assumptions.