Skip to content

Auditing LLM Benchmarks with Item Response Theory

May 2026 · arXiv.org · Vol abs/2605.30504 · 2 citations · 48 references
Computer Science

TL;DR

An Item Response Theory-based indicator is introduced that surfaces likely mislabels at 95% precision in the top 200 examples across seven preference and multiple-choice benchmarks using responses from 114 models, outperforming a supervised classifier.

Abstract

LLM benchmark labels are frozen at release and silently propagated into downstream benchmarks, errors and all. We introduce an Item Response Theory-based indicator that surfaces likely mislabels at 95% precision in the top 200 examples across seven preference and multiple-choice benchmarks using responses from 114 models, outperforming a supervised classifier. We trace these errors to mechanical labeling heuristics, upstream annotation mistakes inherited unchanged from source datasets, and fundamentally ambiguous items without a defensible single label. The same model fit reveals that reward models specialize in stylistic preference rather than factual knowledge, and identifies one frontier reward model that agrees with detected mislabels at 78% accuracy versus 38% for its peers, consistent with benchmark contamination or benchmark-specific over-optimization.

View source

Similar papers

#human-computer interacti... Preprint Sep 2026

Accounting for Stochasticity in Studies of Large Language Model Refusal

Preliminary empirical evidence that single-observation queries are insufficient for evaluations of LLM refusal behaviors is presented, with reliable quantification of refusals required between 15 and 25 repeated queries, well above the single-observation standard common in existing evaluations.

Emma Lurie, Stephanie T. Wang, Sorelle A. Friedler et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Reference-Based Bias Detection in LLMs via Relative Representations of Hidden States

A reference-based method that audits bias in hidden-state representations across related model variants across related model variants, for example before and after fine-tuning, which is complementary to output-based auditing rather than a replacement for it.

M. Jeliński, Jan Dubinski, Maciej Chrabaszcz et al. · 0 citations
#machine learning Preprint Aug 2026

CleanScore: Black-Box Benchmark Audits with Negative Controls and Sensitivity Bounds

CleanScore, a black-box audit using scored outputs only, is presented, a black-box audit using scored outputs only that reports an interval for the public-form advantage rather than a verdict, and a private negative-control bank with an explicit transport radius separates exposure from ordinary form mismatch.

Jeffery Opoku, David Banahene · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.