pith. sign in

arxiv: 1206.3101 · v1 · pith:VJCVVIRTnew · submitted 2012-06-14 · 🧮 math.NA · cs.NA

Oracle inequality for a statistical Raus-Gfrerer type rule

classification 🧮 math.NA cs.NA
keywords errorboundslinearchoiceinverseoracleparameterproblems
0
0 comments X
read the original abstract

The authors study statistical linear inverse problems in Hilbert spaces. Approximate solutions are sought within a class of linear one-parameter regularization schemes, and the parameter choice is crucial to control the root mean squared error. Here a variant of the Raus{Gfrerer rule is analyzed, and it is shown that this parameter choice gives rise to error bounds in terms of oracle inequalities, which in turn provide order optimal error bounds (up to logarithmic factors). These bounds can only be established for solutions which obey a certain self-similarity structure. The proof of the main result relies on some auxiliary error analysis for linear inverse problems under general noise assumptions, and this may be interesting in its own.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.