Measuring Five-Nines Reliability: Sample-Efficient LLM Evaluation in Saturated Benchmarks
Summary
This paper proposes a sample-efficient framework using the cross-entropy method to estimate extreme reliability ('five-nines') in LLMs, addressing the limitations of standard benchmarks in detecting rare failures.
View Cached Full Text
Cached at: 05/13/26, 06:35 AM
# Measuring Five-Nines Reliability: Sample-Efficient LLM Evaluation in Saturated Benchmarks Source: [https://arxiv.org/abs/2605.11209](https://arxiv.org/abs/2605.11209) [View PDF](https://arxiv.org/pdf/2605.11209) > Abstract:While existing benchmarks demonstrate the near\-perfect performance of large language models \(LLMs\) on various tasks, this apparent saturation often obscures the need for rigorous evaluation of their reliability\. In real\-world deployment, however, achieving extremely high reliability \(e\.g\., "five\-nines" \(99\.999%\) vs\. "three\-nines" \(99\.9%\)\) is fundamentally critical, as this gap results in an order\-of\-magnitude increase in failures, which is catastrophic in reliability\-critical applications\. Still, estimating such a rare failure probability with tight confidence bounds requires prohibitively large LLM inference sizes, making standard Monte Carlo evaluation infeasible under limited compute budgets\. In this paper, we observe that LLM failures exhibit strong systematic patterns: across broad parameterized input spaces, a small subset of inputs disproportionately accounts for the majority of failures\. Leveraging this observation, we propose to learn a sampling distribution concentrated on failure\-prone inputs via the cross\-entropy method \(CEM\)\. We evaluate our framework on three LLMs, Qwen2\.5\-Math\-7B\-Instruct, gpt\-oss\-20b\-low, and Gemini 2\.5 Flash Lite, across parameterized GSM8K templates and achieve up to 156\.22x reduction in required inferences compared to naive uniform sampling\. Our estimates reveal that models with indistinguishable accuracy on standard benchmarks can differ substantially in estimated failure rates, underscoring that reliability is a distinct and measurable axis of model quality\. Our simple yet practical framework enables the evaluation of extreme reliability in LLMs, a distinct and underexplored dimension of evaluation beyond existing benchmarks, for their growing use in reliability\-sensitive applications\. ## Submission history From: Eungyeup Kim \[[view email](https://arxiv.org/show-email/592ec145/2605.11209)\] **\[v1\]**Mon, 11 May 2026 20:23:44 UTC \(821 KB\)
Similar Articles
Benchmarking Different Methods of LLM Confidence Estimation
This article benchmarks various blackbox and whitebox methods for LLM confidence estimation, including verbalized confidence, linguistic uncertainty, reasoning-length, P(Answer), P(True), and self-consistency, comparing their effectiveness for tasks like active learning and safety classification.
Quantifying Ranking Uncertainty in LLM Benchmarks
This paper analyzes sources of ranking uncertainty in LLM benchmarks like MMLU, proposing modifications to hypothesis tests for constructing rank confidence intervals, and shows that variability across subjects is substantial.
Benchmarks Are Not Monolithic: Sample-Level Auditing and Orchestration for LLM Evaluation
This paper proposes a dataset-centric meta-evaluation framework that audits LLM benchmarks at the sample level across five latent dimensions, exposing internal heterogeneity and enabling criterion-driven composition of benchmark subsets for targeted model evaluation.
Margin-Adaptive Confidence Ranking for Reliable LLM Judgement
This paper introduces a margin-based confidence ranking method for LLM-as-a-judge systems, learning a dedicated estimator to ensure monotonicity between confidence and human-disagreement risk, with generalization guarantees and improved ranking accuracy across datasets.
Metric Match: A Subset Selection Approach to Evaluating LLM Judge Reliability
This paper introduces Metric Match, a method for selecting a subset of samples for human annotation to estimate LLM judge reliability more efficiently, reducing annotation costs by 32.5% and achieving a win-rate of 0.838 against random selection.