mlsanityData to 7 Oct 2026

Exact Support Recovery for Sparse Spikes Deconvolution

arXiv 1306.6909 ↗First posted 28 Jun 2013math.OC cs.IT cs.NAcited by 22

Not on the map. Why?

Abstract (arXiv)

This paper studies sparse spikes deconvolution over the space of measures. We focus our attention to the recovery properties of the support of the measure, i.e. the location of the Dirac masses. For non-degenerate sums of Diracs, we show that, when the signal-to-noise ratio is large enough, total variation regularization (which is the natural extension of the L1 norm of vectors to the setting of measures) recovers the exact same number of Diracs. We also show that both the locations and the heights of these Diracs converge toward those of the input measure when the noise drops to zero. The exact speed of convergence is governed by a specific dual certificate, which can be computed by solving a linear system. We draw connections between the support of the recovered measure on a continuous domain and on a discretized grid. We show that when the signal-to-noise level is large enough, the solution of the discretized problem is supported on pairs of Diracs which are neighbors of the Diracs of the input measure. This gives a precise description of the convergence of the solution of the discretized problem toward the solution of the continuous grid-free problem, as the grid size tends to zero.

Key facts. Cited by 22 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jun 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 5; 2023: 3; 2024: 2; 2025: 3; 2026: 4.

22 papers.

Sort:

  1. 2021Two-layer neural networks with values in a Banach spacecited by 26
  2. 2021On Learnability via Gradient Method for Two-Layer ReLU Neural Networks in Teacher-Student Settingcited by 16
  3. 2021MARS via LASSOcited by 5
  4. 2023FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measurescited by 3
  5. 2021Sparsest Univariate Learning Models Under Lipschitz Constraintcited by 2
  6. 2022Off-the-grid learning of mixtures from a continuous dictionarycited by 2
  7. 2023Straight-Through meets Sparse Recovery: the Support Exploration Algorithmcited by 2
  8. 2024Second Maximum of a Gaussian Random Field and Exact (t-)Spacing testcited by 2
  9. 2024Representation and Regression Problems in Neural Networks: Relaxation, Generalization, and Numericscited by 2
  10. 2022Polynomial-time Sparse Measure Recovery: From Mean Field Theory to Algorithm Designcited by 1
  11. 2023Fluctuation-based deconvolution in fluorescence microscopy using plug-and-play denoiserscited by 1
  12. 2026Fenchel-Young Duality Gaps: Certified Early Stopping for Regularized Inverse Problemscited by 1
10 more
  1. 2021The Nonconvex Geometry of Linear Inverse Problemscited by 0
  2. 2022Dynamic super-resolution in particle tracking problemscited by 0
  3. 2022Simultaneous off-the-grid learning of mixtures issued from a continuous dictionarycited by 0
  4. 2022Off-the-grid prediction and testing for linear combination of translated featurescited by 0
  5. 2025Sparse Nonparametric Contextual Banditscited by 0
  6. 2025Effective regions and kernels in continuous sparse regularisation, with application to sketched mixturescited by 0
  7. 2025Unlocking Off-the-Grid Sparse Recovery with Unlimited Sensing: Simultaneous Super-Resolution in Time and Amplitudecited by 0
  8. 2026A Dual Certificate Approach to Sparsity in Infinite-Width Shallow Neural Networkscited by 0
  9. 2026Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariancescited by 0
  10. 2026Recovering Lower-Dimensional Semialgebraic Support of a Measure from its Momentscited by 0