The Benchmark Lottery

By Mostafa Dehghani, Yi Tay, Alexey A. Gritsenko, Zhe Zhao, Neil Houlsby, Fernando Diaz, Donald Metzler, Oriol Vinyals. 2021

147 citations recorded by the source corpus.

The world of empirical machine learning (ML) strongly relies on benchmarks in order to determine the relative effectiveness of different algorithms and methods. This paper proposes the notion of"a benchmark lottery"that describes the overall fragility of the ML benchmarking process. The benchmark lottery postulates that many factors, other than fundamental algorithmic superiority, may lead to a method being perceived as superior. On multiple benchmark setups that are prevalent in the ML community, we show that the relative performance of algorithms may be altered significantly simply by choosing different benchmark tasks, highlighting the fragility of the current paradigms and potential fallacious interpretation derived from benchmarking ML methods. Given that every benchmark makes a statement about what it perceives to be important, we argue that this might lead to biased progress in the community. We discuss the implications of the observed phenomena and provide recommendations on mitigating them using multiple machine learning domains and communities as use cases, including natural language processing, computer vision, information retrieval, recommender systems, and reinforcement learning.

Subfields: Artificial Intelligence, Evaluation & Benchmarks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Percy Liang
  3. Luke S. Zettlemoyer
  4. Jianfeng Gao
  5. Yejin Choi
  6. Yi Tay
  7. Quoc V. Le
  8. Hannaneh Hajishirzi

In Evaluation & Benchmarks

  1. Elizabeth Clark
  2. Mohit Bansal
  3. Samuel R. Bowman
  4. Percy Liang
  5. Sebastian Gehrmann
  6. Yejin Choi
  7. Yi Tay
  8. Tushar Khot

Citations in the corpus