Drawing Conclusions from Draws: Rethinking Preference Semantics in Arena-Style LLM Evaluation

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Tang, Raphael, Zhang, Crystina, Li, Wenyan, Lai, Carmen, Stenetorp, Pontus, Lu, Yao
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912623811887104
author Tang, Raphael
Zhang, Crystina
Li, Wenyan
Lai, Carmen
Stenetorp, Pontus
Lu, Yao
author_facet Tang, Raphael
Zhang, Crystina
Li, Wenyan
Lai, Carmen
Stenetorp, Pontus
Lu, Yao
contents In arena-style evaluation of large language models (LLMs), two LLMs respond to a user query, and the user chooses the winning response or deems the "battle" a draw, resulting in an adjustment to the ratings of both models. The prevailing approach for modeling these rating dynamics is to view battles as two-player game matches, as in chess, and apply the Elo rating system and its derivatives. In this paper, we critically examine this paradigm. Specifically, we question whether a draw genuinely means that the two models are equal and hence whether their ratings should be equalized. Instead, we conjecture that draws are more indicative of query difficulty: if the query is too easy, then both models are more likely to succeed equally. On three real-world arena datasets, we show that ignoring rating updates for draws yields a 1-3% relative increase in battle outcome prediction accuracy (which includes draws) for all four rating systems studied. Further analyses suggest that draws occur more for queries rated as very easy and those as highly objective, with risk ratios of 1.37 and 1.35, respectively. We recommend future rating systems to reconsider existing draw semantics and to account for query properties in rating updates.
format Preprint
id arxiv_https___arxiv_org_abs_2510_02306
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Drawing Conclusions from Draws: Rethinking Preference Semantics in Arena-Style LLM Evaluation
Tang, Raphael
Zhang, Crystina
Li, Wenyan
Lai, Carmen
Stenetorp, Pontus
Lu, Yao
Computation and Language
In arena-style evaluation of large language models (LLMs), two LLMs respond to a user query, and the user chooses the winning response or deems the "battle" a draw, resulting in an adjustment to the ratings of both models. The prevailing approach for modeling these rating dynamics is to view battles as two-player game matches, as in chess, and apply the Elo rating system and its derivatives. In this paper, we critically examine this paradigm. Specifically, we question whether a draw genuinely means that the two models are equal and hence whether their ratings should be equalized. Instead, we conjecture that draws are more indicative of query difficulty: if the query is too easy, then both models are more likely to succeed equally. On three real-world arena datasets, we show that ignoring rating updates for draws yields a 1-3% relative increase in battle outcome prediction accuracy (which includes draws) for all four rating systems studied. Further analyses suggest that draws occur more for queries rated as very easy and those as highly objective, with risk ratios of 1.37 and 1.35, respectively. We recommend future rating systems to reconsider existing draw semantics and to account for query properties in rating updates.
title Drawing Conclusions from Draws: Rethinking Preference Semantics in Arena-Style LLM Evaluation
topic Computation and Language
url https://arxiv.org/abs/2510.02306