The cost of using exact confidence intervals for a binomial proportion
Not on the map. Why?
Abstract (arXiv)
When computing a confidence interval for a binomial proportion p one must choose between using an exact interval, which has a coverage probability of at least 1-α for all values of p, and a shorter approximate interval, which may have lower coverage for some p but that on average has coverage equal to 1-α. We investigate the cost of using the exact one and two-sided Clopper--Pearson confidence intervals rather than shorter approximate intervals, first in terms of increased expected length and then in terms of the increase in sample size required to obtain a desired expected length. Using asymptotic expansions, we also give a closed-form formula for determining the sample size for the exact Clopper--Pearson methods. For two-sided intervals, our investigation reveals an interesting connection between the frequentist Clopper--Pearson interval and Bayesian intervals based on noninformative priors.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Mar 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 3; 2026: 4.
11 papers.
- 2024Interpreting Attention Layer Outputs with Sparse Autoencoderscited by 43
- 2025Position: Don't Use the CLT in LLM Evals With Fewer Than a Few Hundred Datapointscited by 22
- 2023Incremental Randomized Smoothing Certificationcited by 12
- 2024Discrete Randomized Smoothing Meets Quantum Computingcited by 2
- 2023IW-GAE: Importance Weighted Group Accuracy Estimation for Improved Calibration and Model Selection in Unsupervised Domain Adaptationcited by 1
- 2025Barrier Certificates for Unknown Systems with Latent States and Polynomial Dynamics using Bayesian Inferencecited by 1
- 2025CeTAD: Towards Certified Toxicity-Aware Distance in Vision Language Modelscited by 0
- 2026Pilot Study on Student Public Opinion Regarding GAIcited by 0
- 2026Efficient Distribution Learning with Error Bounds in Wasserstein Distancecited by 0
- 2026From matrix inversion to constraints: provably tighter confidence regions for importance weights in label shiftcited by 0
- 2026Available Guardrails: Certifying Selective Prediction across ML Systemscited by 0
- 2026Available Guardrails: Certifying Selective Prediction across ML Systems18 Sep 2026
- 2026From matrix inversion to constraints: provably tighter confidence regions for importance weights in label shift13 Sep 2026
- 2026Efficient Distribution Learning with Error Bounds in Wasserstein Distance8 Feb 2026
- 2026Pilot Study on Student Public Opinion Regarding GAI7 Jan 2026
- 2025Barrier Certificates for Unknown Systems with Latent States and Polynomial Dynamics using Bayesian Inference2 Apr 2025
- 2025CeTAD: Towards Certified Toxicity-Aware Distance in Vision Language Models8 Mar 2025
- 2025Position: Don't Use the CLT in LLM Evals With Fewer Than a Few Hundred Datapoints3 Mar 2025
- 2024Discrete Randomized Smoothing Meets Quantum Computing1 Aug 2024
- 2024Interpreting Attention Layer Outputs with Sparse Autoencoders25 Jun 2024
- 2023IW-GAE: Importance Weighted Group Accuracy Estimation for Improved Calibration and Model Selection in Unsupervised Domain Adaptation16 Oct 2023
- 2023Incremental Randomized Smoothing Certification31 May 2023