Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
arXiv:1108.0477
Abstract
Recovering a sparse signal from an undersampled set of random linear measurements is the main problem of interest in compressed sensing. In this paper, we consider the case where both the signal and the measurements are complex. We study the popular reconstruction method of -regularized least squares or LASSO. While several studies have shown that the LASSO algorithm offers desirable solutions under certain conditions, the precise asymptotic performance of this algorithm in the complex setting is not yet known. In this paper, we extend the approximate message passing (AMP) algorithm to the complex signals and measurements and obtain the complex approximate message passing algorithm (CAMP). We then generalize the state evolution framework recently introduced for the analysis of AMP, to the complex setting. Using the state evolution, we derive accurate formulas for the phase transition and noise sensitivity of both LASSO and CAMP.
References in corpus (13)
- Message Passing Algorithms for Compressed Sensing
- High-Resolution Radar via Compressed Sensing
- Consistency of the group Lasso and multiple kernel learning
- Expectation-Maximization Gaussian-Mixture Approximate Message Passing
- Support union recovery in high-dimensional multivariate regression
- Joint-sparse recovery from multiple measurements
- Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
- Taking Advantage of Sparsity in Multi-Task Learning
- A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
- Block-length dependent thresholds in block-sparse compressed sensing
- On Phase Transition of Compressed Sensing in the Complex Domain
- The Benefit of Group Sparsity
- Compressed Sensing over -balls: Minimax Mean Square Error