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

Abstract

The sparse spike estimation problem consists in estimating a number of off-the-grid impulsive sources from under-determined linear measurements. Information theoretic results ensure that the minimization of a non-convex functional is able to recover the spikes for adequately chosen measurements (deterministic or random). To solve this problem, methods inspired from the case of finite dimensional sparse estimation where a convex program is used have been proposed. Also greedy heuristics have shown nice practical results. However, little is known on the ideal non-convex minimization method. In this article, we study the shape of the global minimum of this non-convex functional: we give an explicit basin of attraction of the global minimum that shows that the non-convex problem becomes easier as the number of measurements grows. This has important consequences for methods involving descent algorithms (such as the greedy heuristic) and it gives insights for potential improvements of such descent methods.

References in corpus (4)

• Global Optimality of Local Search for Low Rank Matrix Recovery
• Fundamental performance limits for ideal decoders in high-dimensional linear inverse problems
• Projected gradient descent for non-convex sparse spike estimation
• A Low-Rank Approach to Off-The-Grid Sparse Deconvolution

Cited by in corpus (7)

• On the linear convergence rates of exchange and continuous methods for total variation minimization
• Projected gradient descent for non-convex sparse spike estimation
• The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
• Sketching Datasets for Large-Scale Learning (long version)
• Factorization over interpolation: A fast continuous orthogonal matching pursuit
• Gridless 3D Recovery of Image Sources from Room Impulse Responses
• When compressive learning fails: blame the decoder or the sketch?