The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
Open accessAbstract
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-valued. We study the popular recovery method ofl1-regularized least squares or LASSO. While several studies have shown that LASSO provides 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 solve the complex-valued LASSO problem 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. Our theoretical results are concerned with the case of i.i.d. Gaussian sensing matrices. Simulations confirm that our results hold for a larger class of random matrices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638 · cited 2×
“The group-Lasso algorithm has been extensively studied in the literature [24]–[41].”
BackgroundMethodMessage-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Self-citationIterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
The Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
Eldar, Y. C., Kuppinger, P., & Bolcskei, H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2044837 · Cited by 1,313
Model-Based Compressive Sensing
Baraniuk, R. G., Cevher, V., Duarte, M. F., & Hegde, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2040894 · Cited by 1,308
Self-citationHigh-Resolution Radar via Compressed Sensing
Herman, M. A., & Strohmer, T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2014277 · Cited by 1,048
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Baraniuk, R., & Steeghs, P. (2007) · 2007 IEEE Radar Conference · doi:10.1109/radar.2007.374203 · Cited by 889
Self-citationTheoretical Results on Sparse Representations of Multiple-Measurement Vectors
Chen, J., & Huo, X. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881263 · Cited by 810
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
Bayati, M., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2094817 · Cited by 780
Consistency of the group Lasso and multiple kernel learning
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3390 · Cited by 669
Huang, J., & Zhang, T. (2010) · The Annals of Statistics · doi:10.1214/09-aos778 · Cited by 521
Ji, S., Dunson, D., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2005866 · Cited by 502
Donoho, D., & Tanner, J. (2009) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2009.0152 · Cited by 436
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. (2006) · Cited by 419
Support union recovery in high-dimensional multivariate regression
Obozinski, G., Wainwright, M. J., & Jordan, M. I. (2011) · The Annals of Statistics · doi:10.1214/09-aos776 · Cited by 350
Precise Undersampling Theorems
Donoho, D. L., & Tanner, J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2045630 · Cited by 307
Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
Maleki, A., & Donoho, D. L. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039176 · Cited by 289
Self-citationThe LASSO Risk for Gaussian Matrices
Bayati, M., & Montanari, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2174612 · Cited by 277
Theoretical and Empirical Results for Recovery From Multiple Measurements
van den Berg, E., & Friedlander, M. P. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043876 · Cited by 264
Peng, J., Zhu, J., Bergamaschi, A., Han, W., Noh, D., Pollack, J. R., & Wang, P. (2010) · PubMed · doi:10.1214/09-aoas271supp · Cited by 233
Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
Som, S., & Schniter, P. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2191780 · Cited by 227
Peng, J., Zhu, J., Bergamaschi, A., Han, W., Noh, D.-Y., Pollack, J. R., & Wang, P. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas271 · Cited by 211
Taking Advantage of Sparsity in Multi-Task Learning
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · Cited by 179
Taking Advantage of Sparsity in Multi-Task LearningPreprint
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.1468 · Cited by 178
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
Donoho, D. L., Johnstone, I., & Montanari, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2239356 · Cited by 177
Adaptive regression and model selection in data mining problems
Bakin, S. (1999) · ANU Open Research (Australian National University) · doi:10.25911/5d78db4c25dbb · Cited by 174
On the asymptotic properties of the group lasso estimator for linear models
Nardi, Y., & Rinaldo, A. (2008) · Electronic Journal of Statistics · doi:10.1214/08-ejs200 · Cited by 173
The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
Lv, X., Bi, G., & Wan, C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2105478 · Cited by 106
A Message-Passing Receiver for BICM-OFDM Over Unknown Clustered-Sparse Channels
Schniter, P. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2169232 · Cited by 98
Approximate Message Passing With Consistent Parameter Estimation and Applications to Sparse Learning
Kamilov, U. S., Rangan, S., Fletcher, A. K., & Unser, M. A. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2309005 · Cited by 93
Expectation-maximization Gaussian-mixture approximate message passing
Vila, J. P., & Schniter, P. (2012) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2012.6310932 · Cited by 61
On Phase Transition of Compressed Sensing in the Complex Domain
Yang, Z., Zhang, C., & Xie, L. (2011) · IEEE Signal Processing Letters · doi:10.1109/lsp.2011.2177496 · Cited by 29
Self-citationJalali, S., & Maleki, A. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120382 · Cited by 20
Self-citation
Cited by
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Self-citationSparse Activity Detection for Massive Connectivity
Chen, Z., Sohrabi, F., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2795540 · Cited by 378
A Review of Sparse Recovery Algorithms
Crespo Marques, E., Maciel, N., Naviner, L., Cai, H., & Yang, J. (2019) · IEEE Access · doi:10.1109/access.2018.2886471 · Cited by 268
Compressed CSI Acquisition in FDD Massive MIMO: How Much Training is Needed?
Shen, J.-C., Zhang, J., Alsusa, E., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2535310 · Cited by 99
Sparsity-Aware Learning and Compressed Sensing: An Overview
Theodoridis, S., Kopsinis, Y., & Slavakis, K. (2014) · Academic Press Library in Signal Processing · doi:10.1016/b978-0-12-396502-8.00023-1 · Cited by 14
Metadata
- Authors
- Maleki, A., Anitori, L., Yang, Z., & Baraniuk, R. G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-07
- Volume
- 59
- Issue
- 7
- Pages
- 4290-4308
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2051275493
- Cited by
- 264
- References
- 45
- FWCI
- 24.14
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.