Paper detail

L^1 data fitting for Inverse Problems yields optimal rates of convergence in case of discretized white Gaussian noise

It is well-known in practice, that L^1 data fitting leads to improved robustness compared to standard L^2 data fitting. However, it is unclear whether resulting algorithms will perform as well in case of regular data without outliers. In this paper, we therefore analyze generalized Tikhonov regularization with L^1 data fidelity for Inverse Problems F(u) = g in a general setting, including general measurement errors and errors in the forward operator. The derived results are then applied to the situation of discretized Gaussian white noise, and we show that the resulting error bounds allow for order-optimal rates of convergence. These findings are also investigated in numerical simulations.