We tackle the problem of building adaptive estimation procedures for ill-posed inverse problems. For general regularization methods depending on tuning parameters, we construct a penalized method that selects the optimal smoothing sequence without prior knowledge of the regularity of the function to be estimated. We provide for such estimators oracle inequalities and optimal rates of convergence. This penalized approach is applied to Tikhonov regularization and to regularization by projection. © 2008, Institute of Mathematical Statistics. All rights reserved.
CITATION STYLE
Loubes, J. M., & Ludeňa, C. (2008). Adaptive complexity regularization for linear inverse problems. Electronic Journal of Statistics, 2, 661–677. https://doi.org/10.1214/07-EJS115
Mendeley helps you to discover research relevant for your work.