Ramezanali, Mohammad, Mitra, Partha P, Sengupta, Anirvan M (2016) Mean Field Analysis of Sparse Reconstruction with Correlated Variables. In: European Signal Processing Conference, 29 Aug 2016 - 2 Sep 2016.
Abstract
Sparse reconstruction algorithms aim to retrieve high-dimensional sparse signals from a limited number of measurements. A common example is LASSO or Basis Pursuit where sparsity is enforced using an ℓ -penalty together with a cost function ||y - Hx|| . For random design matrices H, a sharp phase transition boundary separates the 'good' parameter region where error-free recovery of a sufficiently sparse signal is possible and a 'bad' regime where the recovery fails. However, theoretical analysis of phase transition boundary of the correlated variables case lags behind that of uncorrelated variables. Here we use replica trick from statistical physics to show that when an N-dimensional signal x is K-sparse and H is M × N dimensional with the covariance E[H H ] = 1/M C D , with all D = 1, the perfect recovery occurs at M ∼ φ (D)K log(N/M) in the very sparse limit, where φ (D) ≥ 1, indicating need for more observations for the same degree of sparsity. 1 2 ia jb ij ab aa K K 2
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | bioinformatics > computational biology |
| CSHL Authors: | |
| Communities: | CSHL labs > Mitra lab |
| SWORD Depositor: | CSHL Elements |
| Depositing User: | CSHL Elements |
| Date: | 2016 |
| Date Deposited: | 24 May 2021 15:49 |
| Last Modified: | 24 May 2021 15:49 |
| Related URLs: | |
| URI: | https://repository.cshl.edu/id/eprint/40144 |
Actions (login required)
 |
Administrator's edit/view item |