Repository logo
 

Data driven regularization by projection

Published version
Peer-reviewed

Change log

Authors

Abstract

We study linear inverse problems under the premise that the forward operator is not at hand but given indirectly through some input-output training pairs. We demonstrate that regularization by projection and variational regularization can be formulated by using the training data only and without making use of the forward operator. We study convergence and stability of the regularized solutions in view of T. I. Seidman. "Nonconvergence Results for the Application of Least-Squares Estimation to Ill-Posed Problems". Journal of Optimization Theory and Applications 30.4 (1980), pp. 535-547, who showed that regularization by projection is not convergent in general, by giving some insight on the generality of Seidman's nonconvergence example. Moreover, we show, analytically and numerically, that regularization by projection is indeed capable of learning linear operators, such as the Radon transform.

Description

Keywords

data driven regularization, variational regularization, regularization by projection, inverse problems, Gram&#8211, Schmidt orthogonalization

Journal Title

Inverse Problems

Conference Name

Journal ISSN

0266-5611
1361-6420

Volume Title

36

Publisher

IOP Publishing
Sponsorship
Royal Society (NF170045)
Austrian Science Fund (I3661-N27 SFB F68 F6807-N36)