Fetching the paper…
Reading the bibliography…
Approximate Message Passing (AMP) has been shown to be a superior method for inference problems, such as the recovery of signals from sets of noisy, lower-dimensionality measurements, both in terms of reconstruction accuracy and in computational efficiency.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin glass’,” Philosophical Magazine , vol. 35, no. 3, p. 593, 1977
1977
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems . Morgan Kaufmann, 1988
1988
Earlier work this paper cites.
M. Opper and D. Saad, Advanced Mean Field Methods: Theory and Practice . MIT Press, 2001, nIPS workshop series
2001
Earlier work this paper cites.
E. J. Candès and J. Romberg, “Signal recovery from random projections,” in Computational Imaging III . San Jose, CA: Proc. SPIE 5674, 2005, pp. 76–86
2005
Earlier work this paper cites.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Foundations and Trends in Machine Learning , vol. 1, 2008
2008
Earlier work this paper cites.
E. van den Berg and M. P. Friedlander, “Probing the pareto frontier for basis pursuit solutions,” SIAM Journal on Scientific Computing , vol. 31, no. 2, pp. 890–912, 2008
2008
Earlier work this paper cites.
P. T. Boufounos and R. G. Baraniuk, “1-bit compressive sensing,” in Proceedings of the 42 nd 42^{\text{nd}} Annual Conference on Information Sciences and Systems , Princeton, NJ, 2008, pp. 16–21
2008
Earlier work this paper cites.
M. Mézard and A. Montanari, Information, Physics, and Computation . OUP, 2009
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. National Academy of Sciences of the United States of America , vol. 106, no. 45, p. 18914, 2009
2009
Cited alongside, same era.
E. B. Sudderth, A. T. Ihler, M. Isard, W. T. Freeman, and A. S. Willsky, “Nonparametric belief propagation,” Communications of the ACM , vol. 53, no. 10, p. 95, 2010
2010
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Information Theory Proceedings, IEEE Internaional Symposium on , 2011, p. 2168
2011
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, p. 764, 2011
2011
Cited alongside, same era.
L. Jacques, J. N. Laska, P. T. Boufounos, and R. G. Baraniuk, “Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors,” arXiv preprint 1104.3160v3 , 2012
2012
Later among the works it cites.
U. S. Kamilov, V. K. Goyal, and S. Rangan, “Message-passing de-quantization with applications to compressed sensing,” IEEE Transactions on Image Processing , vol. 60, no. 12, p. 6270, 2012
2012
Later among the works it cites.
P. Zhang, F. Krzakala, M. Mézard, and L. Zdeborová, “Non-adaptive pooling strategies for detection of rare faulty items,” in Communications Workshops, Proc. IEEE International Conference on , Budapest, Hungary, 2013, p. 1409
2013
Later among the works it cites.
Y. Xu and Y. Kabashima, “Statistical mechanics approach to 1-bit compressed sensing,” Journal of Statistical Mechanics: Theory and Experiment , no. 2, p. P02041, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Krzakala, M. Mézard, F. Sausset, Y. F. Sun, and L. Zdeborová, “Statistical-physics-based reconstruction in compressed sensing,” Physical Review X , vol. 2, no. 2, p. 021005, 2012
2012
Cited alongside, same era.
——, “Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices,” J. Stat. Mech.: Th. and Exp. , no. 8, p. P08009, 2012
2012
Cited alongside, same era.
D. L. Donoho, A. Javanmard, and A. Montanari, “Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on . IEEE, 2012, p. 1231
2012
Cited alongside, same era.
J. P. Vila and P. Schniter, “Expectation-maximization gaussian-mixture approximate message passing,” in Proc. 46th Annual Conference on Information Sciences and Systems , 2012, p. 1
2012
Cited alongside, same era.
F. Caltagirone, F. Krzakala, and L. Zdeborová, “On convergence of approximate message passing,” in Information Theory Proceedings (ISIT), 2014 IEEE International Symposium on , 2014
2014
Closest in time.
S. Rangan, P. Schniter, and A. K. Fletcher, “On the convergence of approximate message passing with arbitrary matrices,” arXiv preprint 1402.3210 , 2014
2014
Closest in time.
B. Çakmak, O. Winther, and B. H. Fleury, “S-amp: Approximate message passing for general matrix ensembles,” arXiv preprint 1405.2767 , 2014
2014
Closest in time.
Y. Xu, Y. Kabashima, and L. Zdeborová, “Bayesian signal reconstruction for 1-bit compressed sensing,” arXiv preprint 1406.3782 , 2014
2014
Closest in time.