DeepAI AI Chat
Log In Sign Up

The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension

by   Yann Traonmilin, et al.

Non-convex methods for linear inverse problems with low-dimensional models have emerged as an alternative to convex techniques. We propose a theoretical framework where both finite dimensional and infinite dimensional linear inverse problems can be studied. We show how the size of the the basins of attraction of the minimizers of such problems is linked with the number of available measurements. This framework recovers known results about low-rank matrix estimation and off-the-grid sparse spike estimation, and it provides new results for Gaussian mixture estimation from linear measurements. keywords: low-dimensional models, non-convex methods, low-rank matrix recovery, off-the-grid sparse recovery, Gaussian mixture model estimation from linear measurements.


page 1

page 2

page 3

page 4


Lecture notes on non-convex algorithms for low-rank matrix recovery

Low-rank matrix recovery problems are inverse problems which naturally a...

Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity

A general framework for solving image inverse problems is introduced in ...

The basins of attraction of the global minimizers of the non-convex sparse spikes estimation problem

The sparse spike estimation problem consists in estimating a number of o...

An algorithm for non-convex off-the-grid sparse spike estimation with a minimum separation constraint

Theoretical results show that sparse off-the-grid spikes can be estimate...

Signal Recovery on Incoherent Manifolds

Suppose that we observe noisy linear measurements of an unknown signal t...