Pith. sign in

REVIEW 2 cited by

Statistical Uncertainty Quantification for Aggregate Performance Metrics in Machine Learning Benchmarks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.04234 v1 pith:M544ZWX5 submitted 2025-01-08 stat.ML cs.LGstat.AP

classification stat.MLcs.LGstat.AP
keywords tasksmetricsperformanceacrossuncertaintyaggregateaggregatedbenchmark
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modern artificial intelligence is supported by machine learning models (e.g., foundation models) that are pretrained on a massive data corpus and then adapted to solve a variety of downstream tasks. To summarize performance across multiple tasks, evaluation metrics are often aggregated into a summary metric, e.g., average accuracy across 10 question-answering tasks. When aggregating evaluation metrics, it is useful to incorporate uncertainty in the aggregate metric in order to gain a more realistic understanding of model performance. Our objective in this work is to demonstrate how statistical methodology can be used for quantifying uncertainty in metrics that have been aggregated across multiple tasks. The methods we emphasize are bootstrapping, Bayesian hierarchical (i.e., multilevel) modeling, and the visualization of task weightings that consider standard errors. These techniques reveal insights such as the dominance of a specific model for certain types of tasks despite an overall poor performance. We use a popular ML benchmark, the Visual Task Adaptation Benchmark (VTAB), to demonstrate the usefulness of our approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rethinking LLM Parametric Knowledge as Post-retrieval Confidence for Dynamic Retrieval and Reranking

    cs.IR 2025-09 conditional novelty 6.0 of 10

    Shifts in an LLM's hidden-state confidence, before and after a retrieved context, are used as a preference signal to fine-tune a reranker and to trigger retrieval only when initial confidence is low.

  2. Quantifying Ranking Uncertainty in LLM Benchmarks

    cs.LG 2026-06 conditional novelty 5.0 of 10

    MMLU ranking uncertainty is dominated by subject-level variability; rank confidence intervals widen substantially when subjects are treated as the sampling unit.

Pith tools