Dehghani 2021 - The Benchmark Lottery - Overview

Summary

Dehghani, Tay, Gritsenko, Zhao, Houlsby, Diaz, Metzler and Vinyals argue that many factors other than algorithmic superiority determine which method looks best on ML benchmarks. They show empirically that rankings change substantially when the subset of tasks changes (task selection bias), argue that the research community reinforces this (community bias), that benchmarks are stateful because each submission builds on earlier test-set exposure, and that communities without canonical benchmarks can rig the lottery. They close with guidelines, statistical-testing advice, living benchmarks and a reviewer checklist.

Overview

Central claim. “For a method to emerge successful, it has to first win the benchmark lottery”: align with the community-accepted suite, at the right moment, with the right tricks. The lottery metaphor extends Hooker’s hardware lottery.

Evidence. Leaderboard data re-analysed for SuperGLUE (55+ models, 8 tasks), VTAB (32 models, 19 tasks), Long Range Arena (11 models, 5 tasks in the analysed table) and RL Unplugged (Atari, 46 games; DM Control, 9 tasks; 7 baselines). Plus literature case studies: GLUE, recommender-system and ALE evaluation inconsistencies.

Key results.

  • Among the 70 four-of-eight SuperGLUE task subsets, there are 6 distinct Top-1 models; for Top-3 or Top-5 “almost 60 out of 70” subset rankings disagree.
  • VTAB: 12 different winners across 19 single-task rankings; 20 different winners among size-2 task subsets; mean Kendall correlation of single-task rankings with the full score about 0.60.
  • RL Unplugged: average rank correlation of single-task with aggregate about 0.49 (Atari) and 0.54 (DM Control); mean and median aggregates disagree.
  • In the adaptive-analysis regime, once the number of model queries (test set size), test results no longer indicate model quality (Dwork et al., Blum and Hardt).

Main Content

Source Map

Paper sectionPagesContentCovered in
Abstract, 1 Introduction1-4Lottery concept, contributions, roadmapThis note
2 Background4Evaluation questions, hardware lottery link, model dev as fitness-surface optimisationDehghani 2021 - Life of a Benchmark
2.1 Life of a benchmark5Inception, traction, active, maturity, renewalDehghani 2021 - Life of a Benchmark
3 Task selection bias, Fig. 16SuperGLUE disagreementDehghani 2021 - Task Selection Bias Case Studies
3.1.2 VTAB, Fig. 2719 tasks, 3 categories, 32 modelsDehghani 2021 - Task Selection Bias Case Studies
3.1.3 LRA, Table 17-8Top-3 by task subsetDehghani 2021 - Task Selection Bias Case Studies
3.1.4 RL Unplugged, Fig. 38-9Atari/DM Control rank correlationsDehghani 2021 - Task Selection Bias Case Studies
3.2 Score and rank aggregation9-10Mean, macro-average, geometric mean, average rank, robust rank, eliminationDehghani 2021 - Score and Rank Aggregation and Human Evaluation Bias
3.3 Human evaluation bias10Annotator subset effectsDehghani 2021 - Score and Rank Aggregation and Human Evaluation Bias
4, 4.1 Community bias, GLUE10-11Reviewer-driven task choice, label errors, annotation artefactsDehghani 2021 - Community Bias and the GLUE Example
5 Benchmarks are stateful11-13Adaptive data analysis, boosting attack, tricksDehghani 2021 - Stateful Benchmarks and Adaptive Overfitting
6, 6.1, 6.2 Rigging the lottery13-14RecSys, ALE inconsistenciesDehghani 2021 - Rigging the Lottery - RecSys and ALE
7.1 Guidelines14-17Building blocks, creation/usage/reviewer guidelinesDehghani 2021 - Guidelines, Statistical Testing and Living Benchmarks
7.2 Statistical testing17-18Random-sample view, multiple splits, Wilcoxon, Dror et al.Dehghani 2021 - Guidelines, Statistical Testing and Living Benchmarks
7.3 Living benchmarks, 8 Epilogue18-19Creeping overfitting, GEM, DynabenchDehghani 2021 - Guidelines, Statistical Testing and Living Benchmarks
References19-28Citation listCited inline in the notes above
Appendix A-C29-30SuperGLUE rank heatmap, per-task correlation, Table 2Dehghani 2021 - Task Selection Bias Case Studies
Appendix D31VTAB disagreementDehghani 2021 - Task Selection Bias Case Studies
Appendix E, Table 332LRA all subsetsDehghani 2021 - Task Selection Bias Case Studies
Appendix F, Table 433RecSys datasetsDehghani 2021 - Rigging the Lottery - RecSys and ALE
Appendix G34Reviewer checklistDehghani 2021 - Reviewer Checklist and Marketing Measurement Applications

Benchmark lottery

The overall fragility of the ML benchmarking process: “many factors, other than fundamental algorithmic superiority, may lead to a method being perceived as superior.” The factors treated are task selection bias, community bias, statefulness and rigging.

Four mechanisms of the lottery

MechanismPaper sectionOne-line statement
Task selection bias3Relative performance depends strongly on which tasks are included
Community bias4The community decides, implicitly, which benchmarks are acceptable, amplifying task selection
Statefulness5Each new method is built on knowledge of earlier test-set results and tricks
Rigging6Without canonical setups, researchers can fit the benchmark to the model

Examples

See Dehghani 2021 - Task Selection Bias Case Studies for numerical examples, and the Python simulations in that note and in Dehghani 2021 - Stateful Benchmarks and Adaptive Overfitting.

Connections

See Also