An Efficient Approach for Computing Optimal Low-Rank Regularized Inverse Matrices

Abstract

Standard regularization methods that are used to compute solutions to ill-posed inverse problems require knowledge of the forward model. In many real-life applications, the forward model is not known, but training data is readily available. In this paper, we develop a new framework that uses training data, as a substitute for knowledge of the forward model, to compute an optimal low-rank regularized inverse matrix directly, allowing for very fast computation of a regularized solution. We consider a statistical framework based on Bayes and empirical Bayes risk minimization to analyze theoretical properties of the problem. We propose an efficient rank update approach for computing an optimal low-rank regularized inverse matrix for various error measures. Numerical experiments demonstrate the benefits and potential applications of our approach to problems in signal and image processing.

24 pages, 11 figures

Cited by in corpus (6)

• Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions
• Optimal Regularization Parameters for General-Form Tikhonov Regularization
• Learned SVD: solving inverse problems via hybrid autoencoding
• Low-rank computation of posterior covariance matrices in Bayesian inverse problems
• Goal-oriented optimal approximations of Bayesian linear inverse problems
• Generalised Rank-Constrained Approximations of Hilbert-Schmidt Operators on Separable Hilbert Spaces and Applications