Query-efficient model evaluation using cached responses
Not on the map. Why?
Abstract (arXiv)
Evaluating a new model on an existing benchmark is often necessary to understand its behavior before deployment. For modern evaluation frameworks, generating and evaluating a response for all queries can be prohibitively expensive. In practice, responses from previously-evaluated models are often cached -- creating a potential opportunity to use this additional information to decrease the number of queries required to accurately evaluate a new model. In this paper, we introduce an approach for predicting benchmark performance that leverages cached model responses based on the Data Kernel Perspective Space (DKPS), a method for quantifying the relationship between models in the black-box setting. Theoretically, we show that DKPS-based methods are query-efficient under certain conditions. Empirically, we demonstrate that DKPS-based methods achieve the same mean absolute error as baselines with a substantially decreased query budget. We conclude by proposing an offline method for selecting a set of queries that maximizes the goodness-of-fit on reference models, improving prediction accuracy over random query selection.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 46 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
25 of 46 references.
References · 25
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
- 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,324
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 641
- 2023Instruction Tuning for Large Language Models: A Surveycited by 617
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2024A Systematic Survey of Prompt Engineering in Large Language Models: Techniques and Applicationscited by 428
- 2024The Platonic Representation Hypothesiscited by 362
- 2023LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Modelscited by 328
- 2024tinyBenchmarks: evaluating LLMs with fewer examplescited by 295
13 more
- 2023T2I-CompBench++: An Enhanced and Comprehensive Benchmark for Compositional Text-to-image Generationcited by 253
- 2022Datamodels: Predicting Predictions from Training Datacited by 186
- 2023Anchor Points: Benchmarking Models with Much Fewer Examplescited by 84
- 2023Efficient Benchmarking of Language Modelscited by 71
- 2024Active Evaluation Acquisition for Efficient LLM Benchmarkingcited by 33
- 2025We Should Chart an Atlas of All the World's Modelscited by 25
- 2023Comparing Foundation Models using Data Kernelscited by 14
- 2024Tracking the perspectives of interacting language modelscited by 14
- 2024Consistent estimation of generative model representations in the data kernel perspective spacecited by 10
- 2024Statistical inference on black-box generative models in the data kernel perspective spacecited by 9
- 2025Scales++: Compute Efficient Evaluation Subset Selection with Cognitive Scales Embeddingscited by 9
- 2023Approximately optimal domain adaptation with Fisher's Linear Discriminantcited by 2
- 2025Concentration bounds on response-based vector embeddings of black-box generative modelscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.