Statistical sparsity
Peter McCullagh, Nicholas Polson

TL;DR
This paper introduces a mathematical framework for statistical sparsity using exceedance measures and rate parameters, unifying existing models and guiding inference strategies in sparse signal detection.
Contribution
It provides a formal definition of statistical sparsity, characterizes its properties, and shows that inference can focus on exceedance measures rather than detailed signal distributions.
Findings
Sparsity is characterized by a small rate parameter $ ho$.
Sparse models with the same exceedance measure are asymptotically equivalent.
Focusing on exceedance measures simplifies inference in sparse settings.
Abstract
The main contribution of this paper is a mathematical definition of statistical sparsity, which is expressed as a limiting property of a sequence of probability distributions. The limit is characterized by an exceedance measure~ and a rate parameter~, both of which are unrelated to sample size. The definition is sufficient to encompass all sparsity models that have been suggested in the signal-detection literature. Sparsity implies that ~is small, and a sparse approximation is asymptotic in the rate parameter, typically with error in the sparse limit . To first order in sparsity, the sparse signal plus Gaussian noise convolution depends on the signal distribution only through its rate parameter and exceedance measure. This is one of several asymptotic approximations implied by the definition, each of which is most conveniently expressed in terms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Statistical Mechanics and Entropy · Image and Signal Denoising Methods
