Towards optimal algorithms for the recovery of low-dimensional models with linear rates
Yann Traonmilin (IMB), Jean Fran\c{c}ois Aujol (IMB), Antoine Guennec (IMB)

TL;DR
This paper introduces a unifying framework for analyzing and optimizing algorithms that recover low-dimensional models from linear measurements, achieving linear convergence rates and applicable to sparse and neural network-based models.
Contribution
It proposes a class of generalized projected gradient descent algorithms with optimized Lipschitz constants for improved recovery performance.
Findings
Achieves linear convergence rates for low-dimensional recovery algorithms.
Provides a unified interpretation for sparse and neural network-based models.
Demonstrates effectiveness through experiments on synthetic and real data.
Abstract
We consider the problem of recovering elements of a low-dimensional model from linear measurements. From signal and image processing to inverse problems in data science, this question has been at the center of many applications. Lately, with the success of models and methods relying on deep neural networks, there has been a multiplication of different algorithms and recovery results. Comparing the performance of recovery algorithms becomes a complex task without a unifying framework. In this article, as a first step for the study of general algorithms for low-dimensional recovery, we study a class of generalized projected gradient descent algorithms that can recover a given low-dimensional model with linear rates. The obtained rates decouple the impact of the quality of the measurements with respect to the model from the geometry of the properties of the chosen generalized projection:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
