Trust your source: quantifying source condition elements for variational regularisation methods
Source conditions are a key tool in regularisation theory that are needed to derive error estimates and convergence rates for ill-posed inverse problems. In this paper, we provide a recipe to practically compute source condition elements as the solution of convex minimisation problems that can be so...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Source conditions are a key tool in regularisation theory that are needed to
derive error estimates and convergence rates for ill-posed inverse problems. In
this paper, we provide a recipe to practically compute source condition
elements as the solution of convex minimisation problems that can be solved
with first-order algorithms. We demonstrate the validity of our approach by
testing it on two inverse problem case studies in machine learning and image
processing: sparse coefficient estimation of a polynomial via LASSO regression
and recovering an image from a subset of the coefficients of its discrete
Fourier transform. We further demonstrate that the proposed approach can easily
be modified to solve the machine learning task of identifying the optimal
sampling pattern in the Fourier domain for a given image and variational
regularisation method, which has applications in the context of sparsity
promoting reconstruction from magnetic resonance imaging data. |
---|---|
DOI: | 10.48550/arxiv.2303.00696 |