We study a standard method of regularization by projections of the linear inverse problem Y=Af+ε, where ε is a white Gaussian noise, and A is a known compact operator with singular values converging to zero with polynomial decay. The unknown function f is recovered by a projection method using the singular value decomposition of A. The bandwidth choice of this projection regularization is governed by a data-driven procedure which is based on the principle of risk hull minimization. We provide nonasymptotic upper bounds for the mean square risk of this method and we show, in particular, that in numerical simulations this approach may substantially improve the classical method of unbiased risk estimation.
"Risk hull method and regularization by projections of ill-posed inverse problems." Ann. Statist. 34 (4) 1653 - 1677, August 2006. https://doi.org/10.1214/009053606000000542