Fetching the paper…
Reading the bibliography…
Approximate message passing (AMP) is a class of efficient algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal \beta_0 from noisy, linear measurements y = A \beta_0 + w.
G. O. Roberts and J. S. Rosenthal, “Geometric ergodicity and hybrid markov chains,”
1997
Earlier work this paper cites.
P. Lezaud, “Chernoff-type bound for finite markov chains,”
1998
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing,”
2009
Earlier work this paper cites.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,”
2011
Earlier work this paper cites.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in
2011
Earlier work this paper cites.
A. Montanari, “Graphical models concepts in compressed sensing,” in
2012
Cited alongside, same era.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices,”
2012
Cited alongside, same era.
A. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,”
2013
Cited alongside, same era.
OUP Oxford, 2013
S. Boucheron, G. Lugosi, and P. Massart, · 2013
Cited alongside, same era.
J. Tan, Y. Ma, and D. Baron, “Compressive imaging via approximate message passing with image denoising,”
2015
Cited alongside, same era.
C. Rush and R. Venkataramanan, “Finite sample analysis of approximate message passing,” · 2015
Later among the works it cites.
C. Rush, A. Greig, and R. Venkataramanan, “Capacity-achieving sparse regression codes via approximate message passing decoding,” · 2015
Later among the works it cites.
C. Metzler, A. Maleki, and R. G. Baraniuk, “From denoising to compressed sensing,”
2016
Later among the works it cites.
Y. Ma, J. Zhu, and D. Baron, “Approximate message passing algorithm with universal denoting and gaussian mixture learning,”
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…