Asymptotic MMSE Analysis Under Sparse Representation Modeling
Wasim Huleihel, Neri Merhav

TL;DR
This paper rigorously derives an asymptotic formula for the MMSE in sparse signal estimation within compressed sensing, using statistical mechanics and random matrix theory, for large-scale systems with random matrices and noise.
Contribution
It provides a rigorous asymptotic analysis of MMSE in sparse signal recovery under a statistical model, extending previous non-rigorous replica-based results.
Findings
Derived a formula for asymptotic MMSE as system size grows
Utilized methods from statistical mechanics and RMT for analysis
Confirmed the validity of the formula through rigorous derivation
Abstract
Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-case (Hamming) approach and a statistical mechanism, in which the signals are modeled as random processes rather than as individual sequences. In this paper, the second approach is studied. In particular, we consider a model of the form , where each comportment of is given by , where are i.i.d. Gaussian random variables, and are binary random variables independent of , and not necessarily independent and identically distributed (i.i.d.), is a random matrix with i.i.d. entries, and is white Gaussian…
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 · Blind Source Separation Techniques · Random Matrices and Applications
