Stein's unbiased risk estimate and Hyv\"arinen's score matching
Sulagna Ghosh, Nikolaos Ignatiadis, Frederic Koehler, Amber Lee

TL;DR
This paper demonstrates that Stein's Unbiased Risk Estimate (SURE) can effectively be used for denoising signals in empirical Bayes and generative modeling, achieving fast convergence rates and outperforming NPMLE, especially under model misspecification.
Contribution
The paper establishes the theoretical optimality of SURE in empirical Bayes denoising, including under misspecification, and provides practical implementations demonstrating superior performance.
Findings
SURE achieves nearly parametric convergence rates in empirical Bayes.
SURE-training outperforms NPMLE under model misspecification.
Practical methods for heteroscedasticity and side-information are developed.
Abstract
Given a collection of observed signals corrupted with Gaussian noise, how can we learn to optimally denoise them? This fundamental problem arises in both empirical Bayes and generative modeling. In empirical Bayes, the predominant approach is via nonparametric maximum likelihood estimation (NPMLE), while in generative modeling, score matching (SM) methods have proven very successful. In our setting, Hyv\"arinen's implicit SM is equivalent to another classical idea from statistics -- Stein's Unbiased Risk Estimate (SURE). Revisiting SURE minimization, we establish, for the first time, that SURE achieves nearly parametric rates of convergence of the regret in the classical empirical Bayes setting with homoscedastic noise. We also prove that SURE-training can achieve fast rates of convergence to the oracle denoiser in a commonly studied misspecified model. In contrast, the NPMLE may not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
