Unbiased Risk Estimation in the Normal Means Problem via Coupled Bootstrap Techniques
Not on the map. Why?
Abstract (arXiv)
We develop a new approach for estimating the risk of an arbitrary estimator of the mean vector in the classical normal means problem. The key idea is to generate two auxiliary data vectors, by adding carefully constructed normal noise vectors to the original data. We then train the estimator of interest on the first auxiliary vector and test it on the second. In order to stabilize the risk estimate, we average this procedure over multiple draws of the synthetic noise vector. A key aspect of this coupled bootstrap (CB) approach is that it delivers an unbiased estimate of risk under no assumptions on the estimator of the mean vector, albeit for a modified and slightly "harder" version of the original problem, where the noise variance is elevated. We prove that, under the assumptions required for the validity of Stein's unbiased risk estimator (SURE), a limiting version of the CB estimator recovers SURE exactly. We then analyze a bias-variance decomposition of the error of the CB estimator, which elucidates the effects of the variance of the auxiliary noise and the number of bootstrap samples on the accuracy of the estimator. Lastly, we demonstrate that the CB estimator performs favorably in various simulated experiments.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 17 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 3.
6 papers.
- 2021Data fission: splitting a single data pointcited by 14
- 2023Data thinning for convolution-closed distributionscited by 13
- 2024Generalized Recorrupted-to-Recorrupted: Self-Supervised Learning Beyond Gaussian Noisecited by 13
- 2023Generalized Data Thinning Using Sufficient Statisticscited by 8
- 2024Decomposing Gaussians with Unknown Covariancecited by 3
- 2024Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learningcited by 2
- 2024Generalized Recorrupted-to-Recorrupted: Self-Supervised Learning Beyond Gaussian Noise5 Dec 2024
- 2024Revisiting Optimism and Model Complexity in the Wake of Overparameterized Machine Learning2 Oct 2024
- 2024Decomposing Gaussians with Unknown Covariance17 Sep 2024
- 2023Generalized Data Thinning Using Sufficient Statistics22 Mar 2023
- 2023Data thinning for convolution-closed distributions18 Jan 2023
- 2021Data fission: splitting a single data point21 Dec 2021