PulseAugur
EN
LIVE 07:10:36

New method optimizes LLM benchmark prompt selection using submodular functions

Researchers have developed a new method for selecting subsets of prompts for Large Language Model (LLM) benchmarks, aiming to approximate the results of full benchmark suites with significantly fewer prompts. This evaluation-unsupervised approach utilizes submodular subset selection, with facility location functions operating on semantic prompt embeddings proving most effective. The method was tested on a large dataset of 35 benchmarks, 18 LLMs, and over 61,000 prompts, demonstrating superior performance compared to existing baselines in preserving LLM scores. AI

IMPACT This research could lead to more efficient and cost-effective LLM evaluation by reducing the number of prompts needed for benchmarking.

RANK_REASON The item is an academic paper detailing a new methodology for LLM benchmark evaluation. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New method optimizes LLM benchmark prompt selection using submodular functions

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · Jihan Yao, Gantavya Bhatt, Arnav Das, Peter Jin, Ke Bao, Qiaolin Yu, Khushi Bhardwaj, Chang Su, Jialei Wang, Yikai Zhu, Sugam Devare, Damon Mosk-Aoyama, Zhen Dong, Venkat Krishna Srinivasan, Yineng Zhang, Oleksii Kuchaiev, Jiantao Jiao, Banghua Zhu, Jeff… ·

    Coresets Before Score Sets: Evaluation-Unsupervised Prompt Subset Selection for LLM Benchmarks

    arXiv:2607.09739v1 Announce Type: new Abstract: 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 benc…