Skip to content
Preprint

Lost in Aggregation: How Benchmarks Overlook Irreplaceable Model Strengths

Aug 2026 · 0 citations · 36 references
Computer Science

TL;DR

This work argues that benchmark evaluation should also consider the data-centric peak performance frontier, defined by the best statistically supported performance achieved on each dataset, and finds that common aggregation metrics are highly correlated and largely measure consistency and avoiding failures, while being much less aligned with dataset-level irreplaceability.

Abstract

Tabular machine learning benchmarks typically summarize performance by averaging scores, ranks, or pairwise wins across datasets. Such aggregates are useful for selecting robust default models, but they can obscure a different question: which models are necessary to attain peak performance on particular datasets? We argue that benchmark evaluation should also consider the data-centric peak performance frontier, defined by the best statistically supported performance achieved on each dataset. From this perspective, a model may be irreplaceable, sufficient, redundant, or fallible depending on where it lies on the frontier relative to other models. Applying this framework to the TabArena benchmark, we find that common aggregation metrics are highly correlated and largely measure consistency and avoiding failures, while being much less aligned with dataset-level irreplaceability. Consequently, models performing decently across datasets without ever being the best choice are rewarded while models with unique dataset-specific strengths appear mediocre under aggregation. Hence, benchmark progress should be measured not only by improvements on aggregation metrics but also by whether new models expand the set of attainable peak performances across datasets.

View source

Similar papers

How Hard Can Indexing Be? Principled Dataset Hardness Measurement for Learned Indexes

This paper studies the problem of quantifying dataset hardness for learned indexes and proposes two scores, conformance and coverage, that together characterize metric quality while capturing a fundamental tradeoff between metric accuracy and applicability.

Unknown authors · 0 citations
Jul 2026

A Consensus-Based Framework for Relative Preference Evaluation of Large Language Models

A consensus-based evaluation framework that measures relative preference among model-generated responses rather than absolute correctness rather than absolute correctness is introduced, offering an alternative perspective on response quality in scenarios where multiple valid answers exist.

Mohtashim Khan · 0 citations
Preprint Aug 2026

RelShap: Relationally Consistent Shapley Explanations

Experiments show that RelShap produces explanations that are more faithful to the data-generating process, correctly identifying the dominant feature in controlled settings where existing methods, including Conditional SHAP and ManifoldShap, do not.

Seungeun Lee, João Fonseca, Julia Stoyanovich · 0 citations
#machine learning Preprint Aug 2026

Dynamically Allocating Evaluation Effort for Model Ranking

This work formalizes multi-model human evaluation as a best-arm identification problem in a multi-armed bandit setup with correlated arms, where pulling an arm corresponds to human-evaluating a model, and proves the optimality of the proposed algorithms and shows that it improves discrimination between top-performing m...

Vilém Zouhar, Julia Kreutzer, A. Lavie et al. · 0 citations

Public AI Benchmarks Are Broken, But Are Private Benchmarks the Answer?

This work argues for a hybrid public-private approach: keeping the benchmark content private to maintain integrity while making the benchmark design public to build trust, which offers a path toward trustworthy measurement of ever-growing data-intensive AI systems.

Sang T. Truong, S. Wang, Angelina Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.