A Probabilistic Oracle Inequality and Quantification of Uncertainty of a modified Discrepancy Principle for Statistical Inverse Problems

02/25/2022
by   Tim Jahn, et al.
0

In this note we consider spectral cut-off estimators to solve a statistical linear inverse problem under arbitrary white noise. The truncation level is determined with a recently introduced adaptive method based on the classical discrepancy principle. We provide probabilistic oracle inequalities together with quantification of uncertainty for general linear problems. Moreover, we compare the new method to existing ones, namely early stopping sequential discrepancy principle and the balancing principle, both theoretically and numerically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2022

Discretisation-adaptive regularisation of statistical inverse problems

We consider linear inverse problems under white noise. These types of pr...
research
07/13/2022

Noise level free regularisation of general linear inverse problems under unconstrained white noise

In this note we solve a general statistical inverse problem under absenc...
research
04/17/2020

Analyzing the discrepancy principle for kernelized spectral filter learning algorithms

We investigate the construction of early stopping rules in the nonparame...
research
10/19/2017

Early stopping for statistical inverse problems via truncated SVD estimation

We consider truncated SVD (or spectral cut-off, projection) estimators f...
research
06/01/2023

Functional Ghobber-Jaming Uncertainty Principle

Let ({f_j}_j=1^n, {τ_j}_j=1^n) and ({g_k}_k=1^n, {ω_k}_k=1^n) be two p-o...
research
11/18/2022

Robust oracle estimation and uncertainty quantification for possibly sparse quantiles

A general many quantiles + noise model is studied in the robust formulat...

Please sign up or login with your details

Forgot password? Click here to reset