The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Expectation-Maximization Gaussian-Mixture Approximate Message Passing
Open accessAbstract
When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE). If this distribution was a priori known, then one could use computationally efficient approximate message passing (AMP) techniques for nearly minimum MSE (MMSE) recovery. In practice, however, the distribution is unknown, motivating the use of robust algorithms like LASSO-which is nearly minimax optimal-at the cost of significantly larger MSE for non-least-favorable distributions. As an alternative, we propose an empirical-Bayesian technique that simultaneously learns the signal distribution while MMSE-recovering the signal-according to the learned distribution-using AMP. In particular, we model the non-zero distribution as a Gaussian mixture and learn its parameters through expectation maximization, using AMP to implement the expectation step. Numerical experiments on a wide range of signal classes confirm the state-of-the-art performance of our approach, in both reconstruction error and runtime, in the high-dimensional regime, for most (but not all) sensing operators.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,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
Pattern Recognition and Machine Learning
Neal, R. M. (2007) · Technometrics · doi:10.1198/tech.2007.s518 · Cited by 4,571
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Message-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
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Compressed sensing : theory and applications
Eldar, Y. C., & Gitta Kutyniok, B. (2012) · Cited by 2,028
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
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Compressed Sensing: Theory and Applications
(2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511794308 · Cited by 1,660
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559 · cited 2×
“versions, EM-BG-AMP, genie-tuned13 Orthogonal Matching Pursuit (OMP) [29], genie-tuned13 Subspace Pursuit (SP) [30], Bayesian Compressive Sensing (BCS) [19], Sparse Bayesian Learning [18] (via the more robust T-MSBL [31]), de-biased genie-tuned14 LASSO (via SPGL1 [32]), and Smoothed(SL0) [33].”
MethodStoica, P., & Selen, Y. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1311138 · Cited by 1,358
Generalized approximate message passing for estimation with random linear mixing
Rangan, S. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033942 · Cited by 1,103
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
Mohimani, H., Babaie-Zadeh, M., & Jutten, C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007606 · Cited by 1,091
Sparse Signal Recovery With Temporally Correlated Source Vectors Using Sparse Bayesian Learning
Zhang, Z., & Rao, B. D. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2159773 · Cited by 868
Large-Scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction
Efron, B. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511761362 · Cited by 813
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
Compressed Sensing: List of contributors
Eldar, Y. C., & Kutyniok, G. (2012) · Cited by 600
Message passing algorithms for compressed sensing: I. motivation and construction
Donoho, D. L., Maleki, A., & Montanari, A. (2010) · IEEE Information Theory Workshop 2010 (ITW 2010) · doi:10.1109/itwksps.2010.5503193 · Cited by 542
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
SMEM Algorithm for Mixture Models
Ueda, N., Nakano, R., Ghahramani, Z., & Hinton, G. E. (2000) · Neural Computation · doi:10.1162/089976600300015088 · Cited by 409
The Noise-Sensitivity Phase Transition in Compressed Sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165823 · Cited by 339
Statistical physics-based reconstruction in compressed sensing
Krząkała, F., Mézard, M., Sausset, F., Sun, Y., & Zdeborová, L. (2012) · HAL · Cited by 267
Expectation-maximization Bernoulli-Gaussian approximate message passing
Vila, J. P., & Schniter, P. (2011) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2011.6190117 · Cited by 153
Self-citationOptimal Phase Transitions in Compressed Sensing
Wu, Y., & Verdú, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2205894 · Cited by 136
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
Monajemi, H., Jafarpour, S., Gavish, M., Donoho, D. L., Ambikasaran, S., Bacallado, S., Bharadia, D., Chen, Y., Choi, Y., Chowdhury, M., et al. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1219540110 · Cited by 105
Learning with Compressible Priors
Cevher, V. (2009) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 95
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
One-Bit Measurements With Adaptive Thresholds
Kamilov, U. S., Bourquard, A., Amini, A., & Unser, M. A. (2012) · IEEE Signal Processing Letters · doi:10.1109/lsp.2012.2209640 · Cited by 79
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
Self-citation
Cited by
Compressed Channel Estimation for Intelligent Reflecting Surface-Assisted Millimeter Wave Systems
Wang, P., Fang, J., Duan, H., & Li, H. (2020) · IEEE Signal Processing Letters · doi:10.1109/lsp.2020.2998357 · Cited by 530
AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
Borgerding, M., Schniter, P., & Rangan, S. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2708040 · Cited by 455
Self-citationKe, M., Gao, Z., Wu, Y., Gao, X., & Schober, R. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2967175 · Cited by 417
Channel Estimation in Broadband Millimeter Wave MIMO Systems With Few-Bit ADCs
Mo, J., Schniter, P., & Heath, R. W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2781644 · Cited by 348
Self-citationZhang, Z., Jung, T.-P., Makeig, S., & Rao, B. D. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2012.2226175 · Cited by 340
Metadata
- Authors
- Vila, J. P., & Schniter, P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-10
- Volume
- 61
- Issue
- 19
- Pages
- 4658-4672
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2026933032
- Cited by
- 501
- References
- 37
- FWCI
- 32.41
- 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.