Skip to content
NewA calmer, faster ZeroHour

BestRand Reduces Benchmark Compression Errors

Original title: Random Is Almost Enough? Stable and Low-Cost Benchmark Compression via BestRand

Hugging Face daily papersby George Ling, Shanshan Zhong, Lijin Yang ()1 min read
AI summary · x-ai/grok-4.7Summaries by Vani AI

BestRand cuts high-error risk by 50.2% and estimation error by 16.4% at 51.3% of competitor construction cost on 70+ benchmarks.

Random benchmark subsets yield mostly small errors but suffer from a long-tailed distribution of large errors. BestRand preserves random sampling efficiency while mitigating instability. Theory shows most subsets suffice for accurate full-benchmark estimates. Validation across text, multimodal, agent, and VLA benchmarks demonstrates reduced OOD errors.

Key facts
  • Analytical error distribution shows long-tailed risks
  • BestRand reduces high-error tail by 50.2%
  • Estimation error reduced by 16.4% on average
  • Tested on 70+ benchmarks including VLA
  • Code and data available on GitHub
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at huggingface.co

Benchmark compression reduces the often prohibitive time and cost of model evaluation by evaluating models on a small benchmark subset that closely matches full-benchmark results.

Hugging Face daily papers

By George Ling, Shanshan Zhong, Lijin Yang · huggingface.co

Read the full article at Hugging Face daily papers

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.