Sample-Efficient Human Evaluation of Large Language Models via Maximum Discrepancy Competition

Kehua Feng, Keyan Ding, Hongzhi Tan, Kede Ma, Zhihua Wang +6 more
4/10/2024
cs.LGcs.CLcs.HC

Official code: weiji-Feng/MAD-Eval (6 stars, last commit 2025-05-29).

Abstract

Reliable evaluation of large language models (LLMs) is impeded by two key challenges: objective metrics often fail to reflect human perception of natural language, and exhaustive human labeling is prohibitively expensive. Here, we propose a sample-efficient human evaluation method for LLMs based on the principle of MAximum Discrepancy (MAD) Competition. Our method automatically and adaptively selects a compact set of input instructions that maximize semantic discrepancy between pairs of LLM responses. Human evaluators then perform three-alternative forced choices on these paired responses, which are aggregated into a global ranking using Elo rating. We apply our approach to compare eight widely used LLMs across four tasks: scientific knowledge understanding, mathematical reasoning, creative and functional writing, and code generation and explanation. Experimental results show that our sample-efficient evaluation method recovers "gold-standard" model rankings with a handful of MAD-selected instructions, reveals respective strengths and weaknesses of each LLM, and offers nuanced insights to guide future LLM development. Code is available at https://github.com/weiji-Feng/MAD-Eval .

View on arXivView PDF

Code Implementations(1)

[ACL 2025] Sample-Efficient Human Evaluation of Large Language Models via Maximum Discrepancy Competition

60Shell, PythonMar 29, 20241 years ago

Similar Papers

Cite this paper

@article{feng2024sampleefficient,
  title  = {Sample-Efficient Human Evaluation of Large Language Models via Maximum Discrepancy Competition},
  author = {Kehua Feng and Keyan Ding and Hongzhi Tan and Kede Ma and Zhihua Wang and Shuangquan Guo and Yuzhou Cheng and Ge Sun and Guozhou Zheng and Qiang Zhang and Huajun Chen},
  year   = {2024},
  eprint = {2404.08008},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.08008v2}
}

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/2404.08008.svg)](https://codeofpaper.com/paper/2404.08008)

Discussion