Analysis of Sparse Recovery Algorithms via the Replica Method
Ali Bereyhi, Ralf R. M\"uller, Hermann Schulz-Baldes

TL;DR
This paper explores the connection between statistical mechanics and compressive sensing, using the replica method to analyze the asymptotic performance of sparse recovery algorithms with applications in communications.
Contribution
It introduces a novel application of the replica method to evaluate the asymptotic performance of sparse recovery algorithms in compressive sensing.
Findings
Performance characterization of joint sparse recovery algorithms
Guidelines for tuning receivers in spatial signal detection
Analytical insights into algorithm behavior in large systems
Abstract
This manuscript goes through the fundamental connections between statistical mechanics and estimation theory by focusing on the particular problem of compressive sensing. We first show that the asymptotic analysis of a sparse recovery algorithm is mathematically equivalent to the problem of calculating the free energy of a spin glass in the thermodynamic limit. We then use the replica method from statistical mechanics to evaluate the performance in the asymptotic regime. The asymptotic results have several applications in communications and signal processing. We briefly go through two instances of these applications: Characterization of joint sparse recovery algorithms used in distributed compressive sensing, and tuning of receivers employed for detection of spatially modulated signals.
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 · Mathematical Analysis and Transform Methods
