Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This research establishes a fundamental theoretical ceiling for using LLMs as judges in model evaluation, proving that if the judge is not superior to the target model, debiasing techniques cannot reduce annotation costs by more than half. Empirical results further suggest practical savings are even lower, highlighting severe limitations of current scalable evaluation paradigms at the frontier where new models often outperform existing benchmarks. Consequently, relying solely on automated judges without significant ground truth improvements will hit a hard wall in reducing high-quality labeling bottlenecks.
Surse care acoperăarXiv, AI Alignment Forum, Hugging Face
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Limits to scalable evaluation at the frontier: LLM as Judge won't beat twice the data

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2410.13341v4 Announce Type: replace Abstract: High quality annotations are increasingly a bottleneck in the explosively growing machine learning ecosystem. Scalable evaluation methods that avoid costly annotation have therefore become an important research ambition. Many hope to use strong existing models in lieu of costly labels to provide cheap model evaluations. Unfortunately, this method of using models as judges introduces biases, such as self-preferencing, that can distort model comparisons. An emerging family of debiasing tools promises to fix these issues by using a few high quality labels to debias a large number of model judgments. In this paper, we study how far such debiasing methods, in principle, can go. Our main result shows that when the judge is no more accurate than the evaluated model, no debiasing method can decrease the required amount of ground truth labels by more than half. Our result speaks to the severe limitations of the LLM-as-a-judge paradigm at the evaluation frontier where the goal is to assess newly released models that are possibly better than the judge. Through an empirical evaluation, we demonstrate that the sample size savings achievable in practice are even more modest than what our theoretical limit suggests. Along the way, our work provides new observations about debiasing methods for model evaluation, and points out promising avenues for future work.

Abstract:High quality annotations are increasingly a bottleneck in the explosively growing machine learning ecosystem. Scalable evaluation methods that avoid costly annotation have therefore become an important research ambition. Many hope to use strong existing models in lieu of costly labels to provide cheap model evaluations. Unfortunately, this method of using models as judges introduces biases, such as self-preferencing, that can distort model comparisons. An emerging family of debiasing tools promises to fix these issues by using a few high quality labels to debias a large number of model judgments. In this paper, we study how far such debiasing methods, in principle, can go. Our main result shows that when the judge is no more accurate than the evaluated model, no debiasing method can decrease the required amount of ground truth labels by more than half. Our result speaks to the severe limitations of the LLM-as-a-judge paradigm at the evaluation frontier where the goal is to assess newly released models that are possibly better than the judge. Through an empirical evaluation, we demonstrate that the sample size savings achievable in practice are even more modest than what our theoretical limit suggests. Along the way, our work provides new observations about debiasing methods for model evaluation, and points out promising avenues for future work.

Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2410.13341 [cs.LG]

(or arXiv:2410.13341v4 [cs.LG] for this version)

From: Florian E. Dorner [view email] [v1] Thu, 17 Oct 2024 08:49:42 UTC (104 KB) [v2] Tue, 11 Feb 2025 11:39:18 UTC (126 KB) [v3] Tue, 6 Jan 2026 13:00:40 UTC (126 KB) [v4] Mon, 17 Aug 2026 14:32:48 UTC (125 KB)

Text integral sub licența deschisă a publicației · 268 cuvinte

Subiecte conexe