arXiv · 0807.4859
Adaptive complexity regularization for linear inverse problems
Abstract
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.
Explore related subjects
Keep this discovery
Jean-Michel Loubes, Carenne Ludeña. 2008-07-30. Adaptive complexity regularization for linear inverse problems. https://doi.org/10.1214/07-ejs115
Cite the original work for its findings. Save a collection to share your selection of sources.