Fetching the paper…
Reading the bibliography…
Given a high-dimensional data matrix ${\boldsymbol A}\in{\mathbb R}^{m\times n}$, Approximate Message Passing (AMP) algorithms construct sequences of vectors ${\boldsymbol u}^t\in{\mathbb R}^n$, ${\boldsymbol v}^t\in{\mathbb R}^m$, indexed by $t\in\{0,1,2\dots\}$ by iteratively applying ${\boldsymbol A}$ or ${\boldsymbol A}^{{\sf T}}$, and suitable non-linear functions, which depend on the specific application.
Charles Stein, A bound for the error in the normal approximation to the distribution of a sum of dependent random variables , Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, Volume 2: Probability Theory, The Regents of the University of California, 1972
1972
Earlier work this paper cites.
David J Thouless, Philip W Anderson, and Robert G Palmer, Solution of’solvable model of a spin glass’ , Philosophical Magazine 35
1977
Earlier work this paper cites.
Clark R. Givens and Rae Michael Shortt, A class of wasserstein metrics for probability distributions. , Michigan Math. J. 31
1984
Earlier work this paper cites.
Zhi-Dong Bai and Yong-Qua Yin, Necessary and sufficient conditions for almost sure convergence of the largest eigenvalue of a wigner matrix , The Annals of Probability 16
1988
Earlier work this paper cites.
Antoni Buades, Bartomeu Coll, and Jean-Michel Morel, A review of image denoising algorithms, with a new one , SIAM Journal on Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal 4
2005
Earlier work this paper cites.
David L Donoho, Arian Maleki, and Andrea Montanari, Message-passing algorithms for compressed sensing , Proceedings of the National Academy of Sciences 106
2009
Earlier work this paper cites.
Daphne Koller and Nir Friedman, Probabilistic graphical models: principles and techniques , MIT press, 2009
2009
Earlier work this paper cites.
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization , SIAM review 52
2010
Earlier work this paper cites.
Philip Schniter, Turbo reconstruction of structured sparse signals , Information Sciences and Systems (CISS), 2010 44th Annual Conference on, IEEE, 2010, pp. 1–6
2010
Earlier work this paper cites.
Mohsen Bayati and Andrea Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Transactions on Information Theory 57
2011
Earlier work this paper cites.
Venkat Chandrasekaran, Benjamin Recht, Pablo A Parrilo, and Alan S Willsky, The convex geometry of linear inverse problems , Foundations of Computational mathematics 12
2012
Earlier work this paper cites.
Ulugbek Kamilov, Sundeep Rangan, Michael Unser, and Alyson K Fletcher, Approximate message passing with consistent parameter estimation and applications to sparse learning , Advances in Neural Information Processing Systems, 2012, pp. 2438–2446
2012
Earlier work this paper cites.
Andrea Montanari, Graphical models concepts in compressed sensing , Compressed Sensing: Theory and Applications (2012), 394–438
2012
Earlier work this paper cites.
Subhojit Som and Philip Schniter, Compressive imaging using approximate message passing and a markov-tree prior , IEEE transactions on signal processing 60
2012
Earlier work this paper cites.
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart, Concentration inequalities: A nonasymptotic theory of independence , Oxford university press, 2013
2013
Cited alongside, same era.
Emmanuel J Candes, Carlos A Sing-Long, and Joshua D Trzasko, Unbiased risk estimates for singular value thresholding and spectral estimators , IEEE transactions on signal processing 61
2013
Cited alongside, same era.
David L Donoho, Matan Gavish, and Andrea Montanari, The phase transition of matrix recovery from gaussian measurements matches the minimax mse of matrix denoising , Proceedings of the National Academy of Sciences 110
2013
Cited alongside, same era.
David L Donoho, Iain Johnstone, and Andrea Montanari, Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising , IEEE transactions on information theory 59
2013
Cited alongside, same era.
David Donoho and Andrea Montanari, High dimensional robust m-estimation: Asymptotic variance via approximate message passing , Probability Theory and Related Fields 166
2016
Later among the works it cites.
Yoshiyuki Kabashima, Florent Krzakala, Marc Mézard, Ayaka Sakata, and Lenka Zdeborová, Phase transitions and sample complexity in bayes-optimal matrix factorization , IEEE Transactions on Information Theory 62
2016
Later among the works it cites.
Christopher A Metzler, Arian Maleki, and Richard G Baraniuk, From denoising to compressed sensing , IEEE Transactions on Information Theory 62
2016
Later among the works it cites.
Yanting Ma, Junan Zhu, and Dror Baron, Approximate message passing algorithm with universal denoising and gaussian mixture learning , IEEE Transactions on Signal Processing 64
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
Adel Javanmard and Andrea Montanari, State evolution for general approximate message passing algorithms, with applications to spatial coupling , Information and Inference: A Journal of the IMA 2
2013
Cited alongside, same era.
Samet Oymak, Christos Thrampoulidis, and Babak Hassibi, The squared-error of generalized Lasso: A precise analysis , Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton Conference on, IEEE, 2013, pp. 1002–1009
2013
Cited alongside, same era.
Dennis Amelunxen, Martin Lotz, Michael B McCoy, and Joel A Tropp, Living on the edge: Phase transitions in convex programs with random data , Information and Inference: A Journal of the IMA 3
2014
Cited alongside, same era.
Erwin Bolthausen, An iterative construction of solutions of the TAP equations for the Sherrington–Kirkpatrick model , Communications in Mathematical Physics 325
2014
Cited alongside, same era.
David Donoho, Matan Gavish, et al., Minimax risk of matrix denoising by singular value thresholding , The Annals of Statistics 42
2014
Cited alongside, same era.
Mohsen Bayati, Marc Lelarge, Andrea Montanari, et al., Universality in polytope phase transitions and message passing algorithms , The Annals of Applied Probability 25
2015
Cited alongside, same era.
2015
Cited alongside, same era.
Manfred Opper, Burak Cakmak, and Ole Winther, A theory of solving tap equations for ising models with general invariant random matrices , Journal of Physics A: Mathematical and Theoretical 49
2016
Later among the works it cites.
2016
Later among the works it cites.
Cynthia Rush and Ramji Venkataramanan, Finite-sample analysis of approximate message passing , Information Theory (ISIT), 2016 IEEE International Symposium on, IEEE, 2016, pp. 755–759
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Closest in time.
Andrea Montanari and Phan-Minh Nguyen, In preparation, 2017
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
Junjie Ma and Li Ping, Orthogonal amp , IEEE Access 5
2033
Closest in time.