Solution Paths of Variational Regularization Methods for Inverse Problems
Not on the map. Why?
Abstract (arXiv)
We consider a family of variational regularization functionals for a generic inverse problem, where the data fidelity and regularization term are given by powers of a Hilbert norm and an absolutely one-homogeneous functional, respectively, and the regularization parameter is interpreted as artificial time. We investigate the small and large time behavior of the associated solution paths and, in particular, prove finite extinction time for a large class of functionals. Depending on the powers, we also show that the solution paths are of bounded variation or even Lipschitz continuous. In addition, it will turn out that the models are "almost" mutually equivalent in terms of the minimizers they admit. Finally, we apply our results to define and compare two different non-linear spectral representations of data and show that only one of it is able to decompose a linear combination of non-linear eigenfunctions into the individual eigenfunctions. For that purpose, we will also briefly address piecewise affine solution paths.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2021CLIP: Cheap Lipschitz Training of Neural Networkscited by 29
- 2021The Geometry of Adversarial Training in Binary Classificationcited by 20
- 2022Gradient flows and randomised thresholding: sparse inversion and classificationcited by 1
- 2025Optimal Linear Baseline Models for Scientific Machine Learningcited by 0
- 2025Optimal Linear Baseline Models for Scientific Machine Learning7 Aug 2025
- 2022Gradient flows and randomised thresholding: sparse inversion and classification22 Mar 2022
- 2021The Geometry of Adversarial Training in Binary Classification26 Nov 2021
- 2021CLIP: Cheap Lipschitz Training of Neural Networks23 Mar 2021