How Reusable Are Benchmarks with Richer Feedback?
Not on the map. Why?
Abstract (arXiv)
We study whether benchmarks reliably guide model selection as developers adapt to evaluation feedback across multiple criteria. We find that the worst-case test-set size needed to estimate the best score among k adaptively chosen models, under any convex combination of the criteria, grows exponentially with the number of criteria, reaching the Theta(√k) cost of answering k adaptive statistical queries with only O(log k) criteria, at fixed accuracy and confidence. In attacks on multi-task large language model benchmarks with five to ten criteria, feedback restricted to nondominated task profiles produces large reused-to-held-out score gaps and frequent false winners. These results challenge a prominent explanation for prior observed reliable benchmark reuse---that developers mainly respond to convincing improvements over the current best---in rich-feedback settings, while leaving open how often ordinary model development encounters this vulnerability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 28 references that are in the map. First posted on arXiv 26 Sep 2026.
Builds on
19 of 28 references.
References · 19
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
- 2024LiveBench: A Challenging, Contamination-Limited LLM Benchmarkcited by 262
- 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 103
- 2015Algorithmic Stability for Adaptive Data Analysiscited by 88
- 2015The Ladder: A Reliable Leaderboard for Machine Learning Competitionscited by 69
- 2025The Leaderboard Illusioncited by 66
- 2021Dynaboard: An Evaluation-As-A-Service Platform for Holistic Next-Generation Benchmarkingcited by 53
- 2019Model Similarity Mitigates Test Set Overusecited by 38
- 2014Interactive Fingerprinting Codes and the Hardness of Preventing False Discoverycited by 35
- 2014Preventing False Discovery in Interactive Data Analysis is Hardcited by 34
- 2024Inherent Trade-Offs between Diversity and Stability in Multi-Task Benchmarkscited by 28
7 more
- 2020A bounded-noise mechanism for differential privacycited by 15
- 2019The advantages of multiple classes for reducing overfitting from test set reusecited by 14
- 2017Climbing a shaky ladder: Better adaptive risk estimationcited by 6
- 2019Natural Analysts in Adaptive Data Analysiscited by 6
- 2024Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysiscited by 3
- 2017Approximate Convex Hull of Data Streamscited by 2
- 2026Who Defines "Best"? Towards Interactive, User-Defined Evaluation of LLM Leaderboardscited by 2
Built on by
Not cited yet.