Fetching the paper…
Reading the bibliography…
Approximate Message Passing (AMP) algorithms have seen widespread use across a variety of applications.
Combinatorial theory of the free product with amalgamation and operator-valued free probability theory
Roland Speicher · 1998
Earlier work this paper cites.
A family of algorithms for approximate Bayesian inference
Thomas Peter Minka · 2001
Earlier work this paper cites.
Adaptive and self-averaging Thouless-Anderson-Palmer mean-field theory for probabilistic modeling
Manfred Opper and Ole Winther · 2001
Earlier work this paper cites.
Tractable approximations for probabilistic models: The adaptive Thouless-Anderson-Palmer mean field approach
Manfred Opper and Ole Winther · 2001
Earlier work this paper cites.
Moments and cumulants of polynomial random variables on unitary groups, the Itzykson-Zuber integral, and free probability
Benoit Collins · 2003
Earlier work this paper cites.
A CDMA multiuser detection algorithm on the basis of belief propagation
Yoshiyuki Kabashima · 2003
Earlier work this paper cites.
A Fourier view on the R-transform and related asymptotics of spherical integrals
Alice Guionnet and M Maida · 2005
Earlier work this paper cites.
Expectation consistent approximate inference
Manfred Opper and Ole Winther · 2005
Earlier work this paper cites.
Lectures on the combinatorics of free probability
Alexandru Nica and Roland Speicher · 2006
Earlier work this paper cites.
Optimal transport: old and new
Cédric Villani · 2008
Earlier work this paper cites.
Rectangular random matrices, entropy, and fisher’s information
Florent Benaych-Georges · 2009
Earlier work this paper cites.
Rectangular random matrices, related convolution
Florent Benaych-Georges · 2009
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2009
Earlier work this paper cites.
Message passing algorithms for compressed sensing: I. Motivation and construction
David L Donoho, Arian Maleki, and Andrea Montanari · 2010
Earlier work this paper cites.
Message passing algorithms for compressed sensing: II. Analysis and validation
David L Donoho, Arian Maleki, and Andrea Montanari · 2010
Earlier work this paper cites.
Rectangular R-transform as the limit of rectangular spherical integrals
Florent Benaych-Georges · 2011
Earlier work this paper cites.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Florent Benaych-Georges and Raj Rao Nadakuditi · 2011
Earlier work this paper cites.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Earlier work this paper cites.
The LASSO risk for gaussian matrices
Mohsen Bayati and Andrea Montanari · 2011
Earlier work this paper cites.
Generalized approximate message passing for estimation with random linear mixing
Sundeep Rangan · 2011
Earlier work this paper cites.
The singular values and vectors of low rank perturbations of large rectangular random matrices
Florent Benaych-Georges and Raj Rao Nadakuditi · 2012
Earlier work this paper cites.
Iterative estimation of constrained rank-one matrices in noise
Sundeep Rangan and Alyson K Fletcher · 2012
Earlier work this paper cites.
Weakly differentiable functions: Sobolev spaces and functions of bounded variation
William P Ziemer · 2012
Earlier work this paper cites.
Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing
David L Donoho, Adel Javanmard, and Andrea Montanari · 2013
Cited alongside, same era.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Cited alongside, same era.
Asymptotic analysis of complex LASSO via complex approximate message passing (CAMP)
Arian Maleki, Laura Anitori, Zai Yang, and Richard G Baraniuk · 2013
Cited alongside, same era.
An iterative construction of solutions of the TAP equations for the Sherrington–Kirkpatrick model
Erwin Bolthausen · 2014
Cited alongside, same era.
S-AMP: Approximate message passing for general matrix ensembles
Burak Cakmak, Ole Winther, and Bernard H Fleury · 2014
Cited alongside, same era.
False discoveries occur early on the lasso path
Weijie Su, Malgorzata Bogdan, and Emmanuel Candes · 2017
Later among the works it cites.
Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements
Keigo Takeuchi · 2017
Later among the works it cites.
Shrinkage estimation
Dominique Fourdrinier, William E Strawderman, and Martin T Wells · 2018
Later among the works it cites.
Consistent parameter estimation for LASSO and approximate message passing
Ali Mousavi, Arian Maleki, and Richard G Baraniuk · 2018
Later among the works it cites.
Message-passing algorithms for synchronization problems over compact groups
Amelia Perry, Alexander S Wein, Afonso S Bandeira, and Ankur Moitra · 2018
Later among the works it cites.
Algorithmic analysis and statistical estimation of SLOPE via approximate message passing
Zhiqi Bu, Jason Klusowski, Cynthia Rush, and Weijie Su · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Francesco Caltagirone, Lenka Zdeborová, and Florent Krzakala · 2014
Cited alongside, same era.
Information-theoretically optimal sparse PCA
Yash Deshpande and Andrea Montanari · 2014
Cited alongside, same era.
Signal recovery using expectation consistent approximation for linear observations
Yoshiyuki Kabashima and Mikko Vehkaperä · 2014
Cited alongside, same era.
Three lectures on free probability
Jonathan Novak · 2014
Cited alongside, same era.
Compressive phase retrieval via generalized approximate message passing
Philip Schniter and Sundeep Rangan · 2014
Cited alongside, same era.
Universality in polytope phase transitions and message passing algorithms
Mohsen Bayati, Marc Lelarge, and Andrea Montanari · 2015
Cited alongside, same era.
Non-negative principal component analysis: Message passing algorithms and sharp asymptotics
Andrea Montanari and Emile Richard · 2015
Cited alongside, same era.
Later among the works it cites.
Memory-free dynamics for the Thouless-Anderson-Palmer equations of Ising models with arbitrary rotation-invariant ensembles of random coupling matrices
Burak Çakmak and Manfred Opper · 2019
Later among the works it cites.
The overlap gap property and approximate message passing algorithms for p p -spin models
David Gamarnik and Aukosh Jagannath · 2019
Later among the works it cites.
High-temperature expansions and message passing algorithms
Antoine Maillard, Laura Foini, Alejandro Lage Castellanos, Florent Krzakala, Marc Mézard, and Lenka Zdeborová · 2019
Later among the works it cites.
Optimization of the Sherrington-Kirkpatrick hamiltonian
Andrea Montanari · 2019
Later among the works it cites.
Vector approximate message passing
Sundeep Rangan, Philip Schniter, and Alyson K Fletcher · 2019
Later among the works it cites.
On the convergence of approximate message passing with arbitrary matrices
Sundeep Rangan, Philip Schniter, Alyson K Fletcher, and Subrata Sarkar · 2019
Later among the works it cites.
A modern maximum-likelihood theory for high-dimensional logistic regression
Pragya Sur and Emmanuel J Candès · 2019
Later among the works it cites.
The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled chi-square
Pragya Sur, Yuxin Chen, and Emmanuel J Candès · 2019
Later among the works it cites.
A unified framework of state evolution for message-passing algorithms
Keigo Takeuchi · 2019
Later among the works it cites.
Optimization of mean-field spin glasses
Ahmed El Alaoui, Andrea Montanari, and Mark Sellke · 2020
Closest in time.
State evolution for approximate message passing with non-separable functions
Raphael Berthier, Andrea Montanari, and Phan-Minh Nguyen · 2020
Closest in time.
Universality of approximate message passing algorithms
Wei-Kuo Chen and Wai-Kit Lam · 2020
Closest in time.
A dynamical mean-field theory for learning in Restricted Boltzmann machines
Burak Çakmak and Manfred Opper · 2020
Closest in time.
Bayes-optimal convolutional AMP
Keigo Takeuchi · 2020
Closest in time.
Convolutional approximate message-passing
Keigo Takeuchi · 2020
Closest in time.
A unifying tutorial on approximate message passing
Oliver Y Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J Samworth · 2021
Closest in time.