cs.AIAug 14, 2026

Knowing When to Stop: Bayesian Optimal Stopping for LLM Evaluations

Authors: Toby D. Pilditch

Organizations: UK AI Security Institute, London, UK

Abstract

LLM evaluations often use fixed sampling budgets, testing every item the same number of times even after estimates are precise. We introduce optstop, a precision-based adaptive stopping framework that treats evaluation as a sequential measurement problem: keep sampling where uncertainty remains high, and stop where estimates are precise or stable enough. The framework builds on hierarchical Bayesian inference, supports binary, ordinal, and continuous outcomes, and keeps every benchmark item eligible for sampling, without requiring a calibrated item bank. It runs live or retrospectively, and includes a safeguard that samples more cautiously as measured performance approaches zero, where rare successes matter most. In an illustrative 200-item, 10-epoch evaluation, it removes 57%-97% of planned trials across nine validation settings, with overall conclusions equivalent to the full run. These results show that LLM evaluation compute can be allocated by uncertainty rather than by fixed repetition counts, with the magnitude of savings depending on evaluation design.

Figures & tables

Appendix figures & tables11 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Speculative Evaluation of Stochastic LLMs

    Sep 23, 2026Qianli Shen, Xiang Li, Ruomeng Ding +3LLM EvaluationLanguage Model Generation Evaluation

  2. CELEUS: Certifiable and Efficient LLM Evaluation via E-Processes

    Jun 18, 2026Zhijian Zhou, Zesheng Ye, Zhaorun Chen +2LLM EvaluationAnytime-Valid Inference