MINCE: Shrinking LLM Evaluation Datasets via Few-Model Monte Carlo Calibration

arXiv:2606.22826 · cs.AI · Submitted 2026-06-22 · Read on arXiv

cs.AI

Submitted: 2026-06-22

Updated: 2026-09-30

Comments: Accepted to EMNLP 2026, Industry Track

Code: https://github.com/amd/quark

License: http://creativecommons.org/licenses/by/4.0/

The gist: Evaluating LLMs across many model variants---quantized, fine-tuned, or deployment-specific---requires running large benchmarks repeatedly, a process that can take tens of hours per model on edge

Terminology

Abstract

Evaluating LLMs across many model variants---quantized, fine-tuned, or deployment-specific---requires running large benchmarks repeatedly, a process that can take tens of hours per model on edge hardware such as NPUs. Existing subset selection methods reduce this cost but depend on large calibration pools or learned prediction layers. We introduce MINCE (Monte Carlo Informed N-sizing for Compact Evaluation), which uses Monte Carlo simulation over per-item logs from a small set of calibration models to find the minimum subset size that bounds accuracy drift and then fixes a randomly sampled subset at that size, with no prediction layer needed. MINCE reduces IFEVAL by 54%, MMLU by 89%, GSM8K by 70%, and MMLU-Pro by 88% with maximum drift at most 2.62,pp on BF16 calibration models. The frozen subsets generalize to held-out GPU models with mean drift at most 1.40,pp and to INT4 NPU models with mean drift of 0.77--3.59,pp, while delivering evaluation speedups of up to 8.1 times on the GPU models and evaluation speedups of 1.7--3.4 times on the NPU models. The method is robust to calibration pool size and achieves lower drift than tinyBenchmarks (12 times lower on MMLU, 3.3 times on GSM8K) while using 42 times fewer calibration models.

Sources

Related papers