Adapting to unknown noise level in sparse deconvolution. (23rd January 2017)

• Record Type: Journal Article
• Authors: Boyer, Claire; De Castro, Yohann; Salmon, Joseph
• Is Part Of: Information and inference. Volume 6:Number 3(2017)
• Page Start: 310
• Page End: 348
• Publication Date: 2017-01-23
• Subjects: deconvolution -- convex regularization -- inverse problems -- model selection -- concomitant Beurling Lasso -- square-root Lasso -- scaled-Lasso -- sparsity -- rice method; Mathematical models -- Periodicals; 519.605
• DOI: 10.1093/imaiai/iaw024
• Languages: English
• ISSNs: 2049-8764

Abstract

Abstract: In this article, we study sparse spike deconvolution over the space of complex-valued measures when the input measure is a finite sum of Dirac masses. We introduce a modified version of the Beurling Lasso, a semi-definite program that we refer to as the Concomitant Beurling Lasso. This new procedure estimates the target measure and the unknown noise level simultaneously. Contrary to previous estimators in the literature, theory holds for a tuning parameter that depends only on the sample size, so that it can be used for unknown noise level problems. Consistent noise level estimation is standardly proved. As for Radon measure estimation, theoretical guarantees match the previous state-of-the-art results in Super-Resolution regarding minimax prediction and localization. The proofs are based on a bound on the noise level given by a new tail estimate of the supremum of a stationary non-Gaussian process through the Rice method.