mlsanityData to 14 Oct 2026

Show Your Work with Confidence: Confidence Bands for Tuning Curves

arXiv 2311.09480 ↗First posted 16 Nov 2023cs.CL cs.LG stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

The choice of hyperparameters greatly impacts performance in natural language processing. Often, it is hard to tell if a method is better than another or just better tuned. Tuning curves fix this ambiguity by accounting for tuning effort. Specifically, they plot validation performance as a function of the number of hyperparameter choices tried so far. While several estimators exist for these curves, it is common to use point estimates, which we show fail silently and give contradictory results when given too little data. Beyond point estimates, confidence bands are necessary to rigorously establish the relationship between different approaches. We present the first method to construct valid confidence bands for tuning curves. The bands are exact, simultaneous, and distribution-free, thus they provide a robust basis for comparing methods. Empirical analysis shows that while bootstrap confidence bands, which serve as a baseline, fail to approximate their target confidence, ours achieve it exactly. We validate our design with ablations, analyze the effect of sample size, and provide guidance on comparing models with our method. To promote confident comparisons in future work, we release opda: an easy-to-use library that you can install with pip. https://github.com/nicholaslourie/opda

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 16 Nov 2023.

Builds on

21 of 39 references.

References · 21

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  3. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  4. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
  5. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
  6. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
  7. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
  8. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
  9. 2019Green AIcited by 627
  10. 2021Scaling Laws for Transfercited by 272
  11. 2020Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learningcited by 249
  12. 2019A Constructive Prediction of the Generalization Error Across Scalescited by 210
9 more
  1. 2021What Will it Take to Fix Benchmarking in Natural Language Understanding?cited by 203
  2. 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
  3. 2019Show Your Work: Improved Reporting of Experimental Resultscited by 169
  4. 2020The Cost of Training NLP Models: A Concise Overviewcited by 98
  5. 2017Hyperparameter Importance Across Datasetscited by 63
  6. 2019Learning search spaces for Bayesian optimization: Another view of hyperparameter transfer learningcited by 50
  7. 2021Expected Validation Performance and Estimation of a Random Variable's Maximumcited by 6
  8. 2020Showing Your Work Doesn't Always Workcited by 5
  9. 2021Predicting the utility of search spaces for black-box optimization: a simple, budget-aware approachcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 3.

6 papers.