Location of Repository

Necessary and sufficient conditions on sparsity pattern recovery

By Alyson K. Fletcher, Sundeep Rangan, Vivek K Goyal and Senior Member

Abstract

The problem of detecting the sparsity pattern of a k-sparse vector in R n from m random noisy measurements is of interest in many areas such as system identification, denoising, pattern recognition, and compressed sensing. This paper addresses the scaling of the number of measurements m, with signal dimension n and sparsity-level nonzeros k, for asymptotically-reliable detection. We show a necessary condition for perfect recovery at any given SNR for all algorithms, regardless of complexity, is m = Ω(k log(n − k)) measurements. Conversely, it is shown that this scaling of Ω(k log(n − k)) measurements is sufficient for a remarkably simple “maximum correlation ” estimator. Hence this scaling is optimal and does not require more sophisticated techniques such as lasso or matching pursuit. The constants for both the necessary and sufficient conditions are precisely defined in terms of the minimum-toaverage ratio of the nonzero components and the SNR. The necessary condition improves upon previous results for maximum likelihood estimation. For lasso, it also provides a necessary condition at any SNR and for low SNR improves upon previous work. The sufficient condition provides the first asymptotically-reliable detection guarantee at finite SNR

Topics: projections
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.313.1806
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0804.1839... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.