AI RESEARCH
Submodular Benchmark Selection
arXiv CS.LG
•
ArXi:2605.02209v1 Announce Type: cross Evaluating large language models across many benchmarks is expensive, yet many benchmarks are highly correlated. We formalize the selection of a small, informative subset as submodular maximization under a multivariate Gaussian model. Entropy (log-determinant covariance) and mutual information between selected and remaining benchmarks arise as natural objectives.