The dynamics of message passing on dense graphs, with applications to compressed sensing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1528-1532

  Bayati, Mohsen ^a   Montanari, Andrea ^b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; DENSE GRAPHS; DENSITY EVOLUTION; GAUSSIANS; GENERAL CLASS; LARGE SYSTEM; LINEAR MEASUREMENTS; MESSAGE PASSING ALGORITHM; NUMERICAL EXPERIMENTS; SPARSE GRAPHS; SPARSE SIGNALS; STATE EVOLUTIONS;

ALGORITHMS; BIOLOGY; INFORMATION THEORY; SIGNAL RECONSTRUCTION;

MESSAGE PASSING;

EID: 77955685993     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513529     Document Type: Conference Paper

References (13)

1. M. Bayati and A. Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing, http://arxiv.org/abs/1001.3448, 2010.
2. E. Bolthausen, On the high-temperature phase of the sherrington- kirkpatrick model, Seminar at EURANDOM, Eindhoven, September 2009.
3. D. L. Donoho, A. Maleki, and A. Montanari, Message passing algorithms for compressed sensing, Proceedings of the National Academy of Sciences 106 (2009), 18914-18919.
4. -, Message passing algorithms for compressed sensing: I. motivation and construction, Proceedings of IEEE Inform. Theory Workshop (Cairo), 2010.
5. 1-norm near-solution approximates the sparsest near-solution, Communications on Pure and Applied Mathematics 59 (2006), 907-934.
6. D. Guo and C. Wang, Asymptotic mean-square optimality of belief propagation for sparse linear systems, ITW, 2006.
7. T. C. Hu and R. L. Taylor, Strong law for arrays and for the bootstrap mean and variance, Internat. J. Math. and Math. Sci. 20 (1997), 375-383.
8. Y. Kabashima, A cdma multiuser detection algorithm on the basis of belief propagation, J. Phys. A 36 (2003), 11111-11121.
9. A. Montanari and D. Tse, Analysis of belief propagation for nonlinear problems: the example of cdma (or: how to prove tanaka's formula), Proceedings of IEEE Inform. Theory Workshop (Punta de l'Este, Uruguay), 2006.
10. J. Neirotti and D. Saad, Improved message passing for inference in densely connected systems, Europhys. Lett. 71 (2005), 866-872.
11. T.J. Richardson and R. Urbanke, Modern coding theory, Cambridge University Press, Cambridge, 2008.
12. C. 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, 1972.
13. T. Tanaka and O. Okada, Approximate belief propagation, density evolution, and statistical neurodynamics for cdma multiuser detection, IEEE Trans. on info. th. (2005), 700-706. (Pubitemid 40211077)