When +1% Is Not Enough: A Paired Bootstrap Protocol for Evaluating Small Improvements
Not on the map. Why?
Abstract (arXiv)
Recent machine learning papers often report 1-2 percentage point improvements from a single run on a benchmark. These gains are highly sensitive to random seeds, data ordering, and implementation details, yet are rarely accompanied by uncertainty estimates or significance tests. It is therefore unclear when a reported +1-2% reflects a real algorithmic advance versus noise. We revisit this problem under realistic compute budgets, where only a few runs are affordable. We propose a simple, PC-friendly evaluation protocol based on paired multi-seed runs, bias-corrected and accelerated (BCa) bootstrap confidence intervals, and a sign-flip permutation test on per-seed deltas. The protocol is intentionally conservative and is meant as a guardrail against over-claiming. We instantiate it on CIFAR-10, CIFAR-10N, and AG News using synthetic no-improvement, small-gain, and medium-gain scenarios. Single runs and unpaired t-tests often suggest significant gains for 0.6-2.0 point improvements, especially on text. With only three seeds, our paired protocol never declares significance in these settings. We argue that such conservative evaluation is a safer default for small gains under tight budgets.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 24 Nov 2025.
Builds on
8 of 19 references.
References · 8
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2017Deep Reinforcement Learning that Matterscited by 727
- 2020Improving Reproducibility in Machine Learning Research (A Report from the NeurIPS 2019 Reproducibility Program)cited by 318
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 253
- 2021Accounting for Variance in Machine Learning Benchmarkscited by 195
- 2019Show Your Work: Improved Reporting of Experimental Resultscited by 164
- 2017Reporting Score Distributions Makes a Difference: Performance Study of LSTM-networks for Sequence Taggingcited by 71
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026TASR: Training-Free Adaptive Stopping for Iterative Retrievalcited by 4
- 2026Rad-R: A Raw-ADC Radar Dataset and Capture-Invariant SSM for Hardware-Fault Diagnosiscited by 1
- 2026A Triple-Robustness Analysis of Retrieval-Augmented Generation for Multi-Hop Requirements Traceabilitycited by 0
- 2026Universal Pathologies, Conditional Consequences: A Triple-Robustness Analysis of RAG for Multi-Hop Traceabilitycited by 0
- 2026English Word Sense Disambiguation in 2026: When the Labels Become the Bottleneckcited by 0
- 2026Investigating White Blood Cells as a Source of False-Positive Malaria Parasite Detection in African Blood-Smear Imagescited by 0
- 2026Asking for What Was Never Requested: Horizontal and Vertical Proactivity in Agentscited by 0
- 2026Asking for What Was Never Requested: Horizontal and Vertical Proactivity in Agents29 Sep 2026
- 2026Rad-R: A Raw-ADC Radar Dataset and Capture-Invariant SSM for Hardware-Fault Diagnosis31 Aug 2026
- 2026Investigating White Blood Cells as a Source of False-Positive Malaria Parasite Detection in African Blood-Smear Images30 Aug 2026
- 2026A Triple-Robustness Analysis of Retrieval-Augmented Generation for Multi-Hop Requirements Traceability1 Aug 2026
- 2026English Word Sense Disambiguation in 2026: When the Labels Become the Bottleneck19 Jul 2026
- 2026TASR: Training-Free Adaptive Stopping for Iterative Retrieval11 Jun 2026
- 2026Universal Pathologies, Conditional Consequences: A Triple-Robustness Analysis of RAG for Multi-Hop Traceability20 May 2026