The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Open accessAbstract
In this paper, we extend the generalized approximate message passing (G-AMP) approach, originally proposed for high-dimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its application to matrix completion, robust PCA, dictionary learning, and related matrix-factorization problems. Here, in Part I of a two-part paper, we derive our Bilinear G-AMP (BiG-AMP) algorithm as an approximation of the sum-product belief propagation algorithm in the high-dimensional limit, where central-limit theorem arguments and Taylor-series approximations apply, and under the assumption of statistically independent matrix entries with known priors. In addition, we propose an adaptive damping mechanism that aids convergence under finite problem sizes, an expectation-maximization (EM)-based method to automatically tune the parameters of the assumed priors, and two rank-selection strategies. In Part II of the paper, we will discuss the specializations of EM-BiG-AMP to the problems of matrix completion, robust PCA, and dictionary learning, and we will present the results of an extensive empirical study comparing EM-BiG-AMP to state-of-the-art algorithms on each problem.
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
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
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
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
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · neural information processing systems · Cited by 3,798
Probabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
(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
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
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
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
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
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
Stoica, P., & Selen, Y. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1311138 · Cited by 1,358
Dictionaries for Sparse Representation Modeling
Rubinstein, R., Bruckstein, A. M., & Elad, M. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2040551 · Cited by 1,306
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
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
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
Wen, Z., Yin, W., & Zhang, Y. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0044-1 · Cited by 774
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
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
Expectation-Maximization Gaussian-Mixture Approximate Message Passing
Vila, J. P., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272287 · Cited by 501
Self-citationRecovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Tao, M., & Yuan, X. (2011) · SIAM Journal on Optimization · doi:10.1137/100781894 · Cited by 453
Tversky, A., & Kahneman, D. (1993) · Readings in Philosophy and Cognitive Science · doi:10.7551/mitpress/5782.003.0006 · Cited by 348
Freeman, W. T., & Pasztor, E. C. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790414 · Cited by 345
Online identification and tracking of subspaces from highly incomplete information
Balzano, L., Nowak, R., & Recht, B. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706976 · Cited by 331
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Babacan, S. D., Luessi, M., Molina, R., & Katsaggelos, A. K. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2197748 · Cited by 327
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
A Revolution: Belief Propagation in Graphs with Cycles
Frey, B. J., & Mackay, D. (1997) · Cited by 291
Bayesian Robust Principal Component Analysis
Ding, X., He, L., & Carin, L. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2156801 · Cited by 282
On the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Self-citationCompressive Phase Retrieval via Generalized Approximate Message Passing
Schniter, P., & Rangan, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386294 · Cited by 279
Self-citationJavanmard, A., & Montanari, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat004 · Cited by 236
Non-linear matrix factorization with Gaussian processes
Lawrence, N. D., & Urtasun, R. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553452 · Cited by 215
On $l_q$ Optimization and Matrix Completion
Marjanovic, G., & Solo, V. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212015 · Cited by 194
Rank-Constrained Solutions to Linear Matrix Equations Using PowerFactorization
Haldar, J. P., & Hernando, D. (2009) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2018223 · Cited by 156
Exact Recovery of Sparsely-Used DictionariesPreprint
Spielman, D. A., Wang, H., & Wright, J. N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5882 · Cited by 156
Online Robust Subspace Tracking from Partial InformationPreprint
He, J., Balzano, L., & Lui, J. C. S. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.3827 · Cited by 122
Iterative estimation of constrained rank-one matrices in noise
Rangan, S., & Fletcher, A. K. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6283056 · Cited by 78
Compressive phase retrieval via generalized approximate message passing
Schniter, P., & Rangan, S. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483302 · Cited by 66
Self-citationFixed points of generalized approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., Riegler, E., et al. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620309 · Cited by 50
Self-citationPhase diagram and approximate message passing for blind calibration and dictionary learning
Krząkała, F., Mézard, M., & Zdeborová, L. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620308 · Cited by 42
Iterative reconstruction of rank-one matrices in noise
Fletcher, A. K., & Rangan, S. (2017) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iax014 · Cited by 33
Cited by
Cascaded Channel Estimation for Large Intelligent Metasurface Assisted Massive MIMO
He, Z.-Q., & Yuan, X. (2020) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2019.2948632 · Cited by 782
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Bayes-Optimal Joint Channel-and-Data Estimation for Massive MIMO With Low-Precision ADCs
Wen, C.-K., Wang, C.-J., Jin, S., Wong, K.-K., & Ting, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2508786 · Cited by 360
Liu, H., Yuan, X., & Zhang, Y.-J. A. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3007057 · Cited by 313
Metadata
- Authors
- Parker, J. T., Schniter, P., & Cevher, V.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-11
- Volume
- 62
- Issue
- 22
- Pages
- 5839-5853
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1510028821
- Cited by
- 281
- References
- 53
- FWCI
- 16.66
- 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.