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

Abstract

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.

References in corpus (3)

• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• Projected gradient descent for non-convex sparse spike estimation
• Native Banach spaces for splines and variational inverse problems

Cited by in corpus (5)

• PatchNR: Learning from Very Few Images by Patch Normalizing Flow Regularization
• Wasserstein Patch Prior for Image Superresolution
• WPPNets and WPPFlows: The Power of Wasserstein Patch Priors for Superresolution
• Sparse Mixture Models inspired by ANOVA Decompositions
• Stochastic Super-Resolution For Gaussian Textures