tinyBenchmarks: evaluating LLMs with fewer examples

Felipe Maia Polo, Lucas Weber, Leshem Choshen, Yuekai Sun, Gongjun Xu +1 more
2/22/2024
cs.CLcs.AIcs.LG

No official code found. Best implementation: felipemaiapolo/tinyBenchmarks (179 stars, MIT, last commit 2024-04-12).

Abstract

The versatility of large language models (LLMs) led to the creation of diverse benchmarks that thoroughly test a variety of language models' abilities. These benchmarks consist of tens of thousands of examples making evaluation of LLMs very expensive. In this paper, we investigate strategies to reduce the number of evaluations needed to assess the performance of an LLM on several key benchmarks. For example, we show that to accurately estimate the performance of an LLM on MMLU, a popular multiple-choice QA benchmark consisting of 14K examples, it is sufficient to evaluate this LLM on 100 curated examples. We release evaluation tools and tiny versions of popular benchmarks: Open LLM Leaderboard, MMLU, HELM, and AlpacaEval 2.0. Our empirical analysis demonstrates that these tools and tiny benchmarks are sufficient to reliably and efficiently reproduce the original evaluation results.

View on arXivView PDF

Code Implementations(1)

MIT

Evaluating LLMs with fewer examples

17921Python, Jupyter NotebookFeb 15, 20242 years agoMIT

Similar Papers

Cite this paper

@article{polo2024tinybenchmarks,
  title  = {tinyBenchmarks: evaluating LLMs with fewer examples},
  author = {Felipe Maia Polo and Lucas Weber and Leshem Choshen and Yuekai Sun and Gongjun Xu and Mikhail Yurochkin},
  year   = {2024},
  eprint = {2402.14992},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.14992v2},
  journal = {ICML 2024 2024}
}

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

Discussion