Confident Rankings with Fewer Items: Adaptive LLM Evaluation with Continuous Scores

Esma Balkır, Alice Pernthaller, Marco Basaldella, José Hernández-Orallo, Nigel Collier
1/20/2026
cs.CLcs.AI

No official code found. Best implementation: trismik/continuous-cat (0 stars, last commit 2026-02-02).

Abstract

Computerized Adaptive Testing (CAT) has proven effective for efficient LLM evaluation on multiple-choice benchmarks, but modern LLM evaluation increasingly relies on generation tasks where outputs are scored continuously rather than marked correct/incorrect. We present a principled extension of IRT-based adaptive testing to continuous bounded scores (ROUGE, BLEU, LLM-as-a-Judge) by replacing the Bernoulli response distribution with a heteroskedastic normal distribution. Building on this, we introduce an uncertainty aware ranker with adaptive stopping criteria that achieves reliable model ranking while testing as few items and as cheaply as possible. We validate our method on five benchmarks spanning n-gram-based, embedding-based, and LLM-as-judge metrics. Our method uses 2% of the items while improving ranking correlation by 0.12 τ over random sampling, with 95% accuracy on confident predictions.

View on arXivView PDF

Code Implementations(1)

Adaptive LLM Evaluation with Continuous Scores

00PythonJan 19, 20268 months agoNOASSERTION

Cite this paper

@article{balkr2026confident,
  title  = {Confident Rankings with Fewer Items: Adaptive LLM Evaluation with Continuous Scores},
  author = {Esma Balkır and Alice Pernthaller and Marco Basaldella and José Hernández-Orallo and Nigel Collier},
  year   = {2026},
  eprint = {2601.13885},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.13885v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.13885.svg)](https://codeofpaper.com/paper/2601.13885)

Discussion