Iterative estimation of constrained rank-one matrices in noise

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1246-1250

  Rangan, Sundeep ^a   Fletcher, Alyson K ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS METHOD; ASYMPTOTIC BEHAVIORS; COMPRESSIVE SENSING; EQUIVALENT MODEL; ESTIMATION PROBLEM; GAUSSIAN APPROXIMATIONS; GENERAL METHOD; HIGH-DIMENSIONAL; ITERATIVE ESTIMATION; ITERATIVE PROCEDURES; LEARNING PROBLEM; LOOPY BELIEF PROPAGATION; PRECISE ANALYSIS; PROBABILISTIC MODELS; RANK-ONE MATRIX; STATE EVOLUTION EQUATIONS;

ESTIMATION; GAUSSIAN NOISE (ELECTRONIC); INFORMATION THEORY;

ITERATIVE METHODS;

EID: 84867561082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283056     Document Type: Conference Paper

References (27)

1. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1985, reprinted with corrections 1987.
2. J. Cadima and I. T. Jolliffe, "Loadings and correlations in the interpretation of principal components," J. Appl. Stat., vol. 22, pp. 208-214, 1995.
3. B. A. Olshausen and D. J. Field, "Natural image statistics and efficient coding," Network Comp. Neural Syst., vol. 7, no. 2, pp. 333-339, 1996.
4. -, "Sparse coding with an overcomplete basis set: A strategy employed by v1?" J. Vis. Res., vol. 37, pp. 3311-3325, 1997.
5. D. D. Lee and H. S. Seung, "Algorithms for non-negative matrix factorization," in Proc. Neural Information Process. Syst., Vancouver, Canada, Dec. 2001.
6. M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations," Neural Comp., vol. 12, pp. 337-365, 2000.
7. M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006.
8. J. T. Parker, V. Cevher, and P. Schniter, "Compressive sensing under matrix uncertainties: An approximate message passing approach," in Conf. Rec. Asilomar Conf. on Signals, Syst. & Computers, Pacific Grove, CA, Nov. 2011.
9. J. Mairal, F. Bach, G. Sapiro, and J. Ponce, "Online dictionary learning for sparse coding," in Proc. ICML, Montréal, Canada, Jun. 2009.
10. 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.
11. 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.
12. A. Montanari and D. Tse, "Analysis of belief propagation for non-linear problems: The example of CDMA (or: How to prove Tanaka's formula)," arXiv:cs/0602028v1 [cs.IT]., Feb. 2006.
13. D. Guo and C.-C. Wang, "Asymptotic mean-square optimality of belief propagation for sparse linear systems," in Proc. IEEE Inform. Theory Workshop, Chengdu, China, Oct. 2006, pp. 194-198.
14. -, "Random sparse linear systems observed via arbitrary channels: A decoupling principle," in Proc. IEEE Int. Symp. Inform. Theory, Nice, France, Jun. 2007, pp. 946-950.
15. S. Rangan, "Estimation with random linear mixing, belief propagation and compressed sensing," arXiv:1001.2228v1 [cs.IT]., Jan. 2010.
16. -, "Generalized approximate message passing for estimation with random linear mixing," arXiv:1010.5141v1 [cs.IT]., Oct. 2010.
17. S. Rangan and A. K. Fletcher, "Iterative Estimation of Constrained Rank-One Matrices in Noise," arXiv preprint, Feb. 2011.
18. D. Guo, D. Baron, and S. Shamai, "A single-letter characterization of optimal noisy compressed sensing," in Proc. 47th Ann. Allerton Conf. on Commun., Control and Comp., Monticello, IL, Sep.-Oct. 2009.
19. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Trans. Inform. Theory, vol. 56, no. 6, pp. 2980-2998, Jun. 2010.
20. M. Capitaine, C. Donati-Martin, and D. Féral, "The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations," Ann. Probability, vol. 37, no. 1, pp. 1-47, Jan. 2009.
21. D. Guo, Y. Wu, S. Shamai, and S. Verdú, "Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error," IEEE Trans. Inform. Theory, vol. 57, no. 4, pp. 2371 -2385, Apr. 2011.
22. Y. Wu and S. Verdú, "Functional Properties of Minimum Mean-Square Error and Mutual Information," IEEE Trans. Inform. Theory, vol. 58, no. 3, pp. 1289-1301, Mar. 2012.
23. I. T. Jolliffe, N. Trendafilov, and M. Uddin, "A modified principal component technique based on the LASSO," J. Comput. Graphical Stat., vol. 12, pp. 531-547, 2003.
24. Z. Zhang, H. Zha, and H. Simon, "Low rank approximations with sparse factors I: Basic algorithms and error analysis," SIAM J. Matrix Anal. Appl., vol. 23, no. 3, pp. 706-727, 2002.
25. H. Zou, T. Hastie, and R. Tibshirani, "Sparse principal component analysis," J. Comput. Graphical Stat., vol. 15, no. 2, pp. 265-286, Jun. 2006.
26. A. d'Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet, "A direct formulation for sparse PCA using semidefinite programming," SIAM Rev., vol. 49, no. 3, pp. 434-448, Mar. 2007.
27. H. Shena and J. Z. Huang, "Sparse principal component analysis," J. Multivariate Anal., vol. 99, no. 6, pp. 1015-1034, Jul. 2008.