Fixed points of generalized approximate message passing with arbitrary matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 664-668

  Rangan, Sundeep ^a   Schniter, Philip ^b   Riegler, Erwin ^c   Fletcher, Alyson ^d   Cevher, Volkan ^e  

^a POLYTECHNIC UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c Institute of Telecommunications   (Austria)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e EPFL   (United States)

Author keywords

ADMM; Belief propagation; message passing; variational optimization

Indexed keywords

ADMM; ARBITRARY MATRICES; BELIEF PROPAGATION; GAUSSIAN APPROXIMATIONS; INDEPENDENT COMPONENTS; LOOPY BELIEF PROPAGATION; OPTIMIZATION TECHNIQUES; VARIATIONAL OPTIMIZATION;

ALGORITHMS; ESTIMATION; INFORMATION THEORY; MESSAGE PASSING; OPTIMIZATION;

MATHEMATICAL TRANSFORMATIONS;

EID: 84890407253     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620309     Document Type: Conference Paper

References (24)

1. P. McCullagh and J. A. Nelder, Generalized linear models, 2nd ed. Chapman &Hall, 1989.
2. Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications. New York: Cambridge Univ. Press, 2012.
3. A. Chambolle, R. A. DeVore, N. Y. Lee, and B. J. Lucier, "Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage," IEEE Trans. Image Process., vol. 7, no. 3, pp. 319-335, Mar. 1998.
4. I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, Nov. 2004.
5. S. J. Wright, R. D. Nowak, and M. Figueiredo, "Sparse reconstruction by separable approximation," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2479-2493, Jul. 2009.
6. A. Beck and M. Teboulle, "A fast iterative shrinkage-Thresholding algorithm for linear inverse problem," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
7. Y. E. Nesterov, "Gradient methods for minimizing composite objective function," CORE Report, 2007.
8. J. Bioucas-Dias and M. Figueiredo, "A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration," IEEE Trans. Image Process., vol. 16, no. 12, pp. 2992-3004, Dec. 2007.
9. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Found. Trends Mach. Learn., vol. 3, no. 1, 2010.
10. J. E. Esser, "Primal dual algorithms for convex models and applications to image restoration, registration and nonlocal inpainting," Ph.D. dissertation, The University of California, Los Angeles, 2010.
11. A. Chambolle and T. Pock, "A first-order primal-dual algorithm for convex problems with applications to imaging," J. Math. Imaging Vis., vol. 40, pp. 120-145, 2011.
12. B. He and X. Yuan, "Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective," SIAM J. Imaging Sci., vol. 5, no. 1, pp. 119-149, 2012.
13. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci., vol. 106, no. 45, pp. 18 914-18 919, Nov. 2009.
14. -, "Message passing algorithms for compressed sensing I: motivation and construction," in Proc. Info. Theory Workshop, Jan. 2010.
15. -, "Message passing algorithms for compressed sensing II: analysis and validation," in Proc. Info. Theory Workshop, Jan. 2010.
16. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing," IEEE Trans. Inform. Theory, vol. 57, no. 2, pp. 764-785, Feb. 2011.
17. S. Rangan, "Estimation with random linear mixing, belief propagation and compressed sensing," in Proc. Conf. on Inform. Sci. &Sys., Princeton, NJ, Mar. 2010, pp. 1-6.
18. -, "Generalized approximate message passing for estimation with random linear mixing," in Proc. IEEE Int. Symp. Inform. Theory, Saint Petersburg, Russia, Jul.-Aug. 2011, pp. 2174-2178.
19. A. Javanmard and A. Montanari, "State evolution for general approximate message passing algorithms, with applications to spatial coupling," arXiv:1211.5164 [math.PR]., Nov. 2012.
20. S. Rangan, P. Schniter, E. Riegler, A. Fletcher, and V. Cevher, "Fixed points of generalized approximate message passing with arbitrary matrices," arXiv preprint, Jan. 2013.
21. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," Found. Trends Mach. Learn., vol. 1, 2008.
22. J. Boutros and G. Caire, "Iterative multiuser joint decoding: Unified framework and asymptotic analysis," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1772-1793, Jul. 2002.
23. T. P. Minka, "A family of algorithms for approximate Bayesian inference," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2001.
24. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Royal Stat. Soc., Ser. B, vol. 58, no. 1, pp. 267-288, 1996.