We study LLM benchmark coreset selection: selecting a small subset of prompts over multiple benchmarks whose induced model scores and rankings approximate those obtained from the full benchmark suite.
In evaluation-unsupervised benchmark coreset selection (our approach), the selection algorithm uses no model evaluation outcomes and operates on a fine granularity by producing subsets of prompts over multiple benchmarks rather than producing a sub-collection of entire benchmarks.
We use submodular subset selection, and we develop and evaluate many different submodular functions for this purpose, including determinantal point process (DPP) based approaches, submodular mutual information functions, and facility location-based functions.
On a new large-scale suite of 35 heterogeneous benchmarks spanning five different capability categories, 18 frontier LLMs, and over 61K prompts, we find that the facility location (FL) function operating exclusively on inexpensive semantic prompt embeddings preserves LLM scores better than twelve separate score-based and diversity-based baselines, across a range of coreset budgets.
Moreover, we show our proposed objective is not limited to the evaluation-unsupervised regime: in the setting where only a handful of whole benchmarks must be selected and a large amount of model scores are available, the same objective matches or outperforms state-of-the-art baselines on the MMLU and MTEB leaderboards, while being substantially cheaper to compute.
Together, our results suggest that submodularity, in general, is a strong and reliable tool for benchmark compression.
Blogger's Review: This paper presents an unsupervised coreset selection method that demonstrates the potential of submodularity in optimizing LLM benchmarks, especially in enhancing evaluation effectiveness while reducing computational costs. This research not only enriches the theoretical foundation of benchmark selection but also provides practical guidance, making it worth attention.