Poisson Matrix Recovery and Completion

IEEE Transactions on Signal Processing

Volumn 64, Issue 6, 2016, Pages 1609-1620

  Cao, Yang ^a   Xie, Yao ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Estimation; information theoretic bounds; low rank matrix recovery; matrix completion; Poisson noise

Indexed keywords

ALGORITHMS; ESTIMATION; INFORMATION THEORY; ITERATIVE METHODS; MAXIMUM LIKELIHOOD; MAXIMUM LIKELIHOOD ESTIMATION; POISSON DISTRIBUTION; RECOVERY; SIGNAL TO NOISE RATIO;

COMBINING TECHNIQUES; INFORMATION THEORETIC BOUNDS; LINEAR COMBINATIONS; LOW-RANK MATRIX RECOVERIES; MATRIX COMPLETION; POISSON LIKELIHOOD FUNCTION; POISSON NOISE; UPPER AND LOWER BOUNDS;

MATRIX ALGEBRA;

EID: 84962029981     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2015.2500192     Document Type: Article

References (53)

1. M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters, "1-bit matrix completion, information and inference," Inf. Inference, vol. 3, no. 3, pp. 189-223, Sep. 2014.
2. D. J. Brady, Optical Imaging and Spectroscopy. New York, NY, USA: Wiley, 2009.
3. J. A. Bazerque, G. Mateos, and G. B. Giannakis, "Inference of Poisson count processes using low-rank tensor data," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2013, pp. 5989-5993.
4. H. Shen and J. Z. Huang, "Analysis of call centre arrival data using singular value decomposition," Appl. Stochast. Models Bus. Indust., vol. 21, pp. 251-263, 2005.
5. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, pp. 5406-5425, Dec. 2006.
6. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, Apr. 2006.
7. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Computat. Math. (FOCS), vol. 9, no. 6, pp. 717-772, 2009.
8. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2980-2998, 2010.
9. E. J. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, 2010.
10. W. Dai and O. Milenkovic, "Set: An algorithm for consistent matrix completion," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), 2010, pp. 3646-3649.
11. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, no. 3, pp. 471-501, 2010.
12. B. Recht, "A simpler approach to matrix completion," J. Mach. Learn. Res., vol. 12, pp. 3413-3430, 2011.
13. J.-F. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optimiz., vol. 20, no. 4, pp. 1956-1982, 2010.
14. Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma, "Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix," in Proc. Int. Workshop Comp. Adv. Multi-Sens. Adapt. Process. (CAMSAP), Aruba, Dutch Antilles, vol. 61.
15. R. Mazumder, T. Hastie, and R. Tibshirani, "Spectral regularization algorithms for learning large incomplete matrices," J. Mach. Learn. Res., vol. 11, pp. 2287-2322, 2010.
16. R. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries," in Proc. Adv. Neural Inf. Process. Syst. (NIPS), 2009, pp. 952-960.
17. E. J. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, 2010.
18. S. Negahban et al., "Estimation of (near) low-rank matrices with noise and high-dimensional scaling," Ann. Stats., vol. 39, no. 2, pp. 1069-1097, 2011.
19. S. Negahban and M. J. Wainwright, "Restricted strong convexity and weighted matrix completion: Optimal bounds with noise," J. Mach. Learn. Res., vol. 13, no. 1, pp. 1665-1697, 2012.
20. A. Rohde et al., "Estimation of high-dimensional low-rank matrices," Ann. Statist., vol. 39, no. 2, pp. 887-930, 2011.
21. A. Soni, S. Jain, J. Haupt, and S. Gonella, "Error bounds for maximum likelihood matrix completion under sparse factor models," in Proc. IEEE Global Conf. Signal Inf. Proc. (GlobalSIP), Atlanta, GA, USA, 2014, pp. 399-403.
22. A. Soni, S. Jain, J. Haupt, and S. Gonella, "Noisy matrix completion under sparse factor models," 2014, ArXiv:1411 [Online]. Available: http://arxiv.org/abs/1411.0282
23. A. Soni and J. Haupt, "Estimation error guarantees for Poisson denoising with sparse and structured dictionary models," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2014, pp. 2002-2006.
24. M. Raginsky, R. M. Willett, Z. T. Harmany, and R. F. Marcia, "Compressed sensing performance bounds under Poisson noise," IEEE Trans. Signal Process., vol. 58, no. 8, pp. 3990-4002, 2010.
25. M. Raginsky, S. Jafarpour, Z. T. Harmany, R. F. Marcia, R. M. Willett, and R. Calderbank, "Performance bounds for expander-based compressed sensing in Poisson noise," IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4139-4153, 2011.
26. X. Jiang, G. Raskutti, and R. Willett, "Minimax optimal rates for Poisson inverse problems with physical constraints," 2014, ArXiv:1403.6532 [Online]. Available: http://arxiv.org/abs/1403.6532
27. Q. Tran-Dinh, A. Kyrillidis, and V. Cevher, "A proximal Newton framework for composite minimization: Graph learning without Cholesky decomposition and matrix inversions," in Proc. 30th Int. Conf. Mach. Learn. (ICML), Atlanta, GA, USA, 2013, pp. 271-279.
28. Q. Tran-Dinh, A. Kyrillidis, and V. Cevher, "Composite self-concordant minimization," J. Mach. Learn. Res., 2014.
29. Y. Plan, "Compressed sensing, sparse approximation, and low-rank matrix estimation," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA, USA, 2011.
30. E. J. Candes and Y. Plan, "Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2342-2359, 2011.
31. S. Ji and J. Ye, "An accelerated gradient method for trace norm minimization," in Proc. ACM 26th Ann. Int. Conf. Mach. Learn., 2009, pp. 457-464.
32. M. J. Wainwright, "Structured regularizers for high-dimensional problems: Statistical and computational issues," Ann. Rev. Statist. Appl., vol. 1, pp. 233-253, 2014.
33. A. Agarwal, S. Negahban, and M. J. Wainwright, "Fast global convergence rates of gradient methods for high-dimensional statistical recovery," in Proc. Adv. Neural Inf. Process. Syst. (NIPS), 2010, pp. 37-45.
34. J. Lafond, "Low rank matrix completion with exponential family noise," 2015, ArXiv:1502.06919 [Online]. Available: http://arxiv.org/abs/1502.06919
35. M. J. Wainwright, "Structured regularizers for high-dimensional problems: Statistical and computational issues," Ann. Rev. Statist. Appl., pp. 233-253, 2014.
36. S. Boyd, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
37. M. Kloft, U. Brefeld, P. Laskov, K.-R Müller, A. Zien, and S. Sonnenburg, "Efficient and accurate LP-norm multiple kernel learning," in Proc. Adv. Neural Inf. Process. Syst., 2009, pp. 997-1005.
38. E. J. Candes and M. A. Davenport, "How well can we estimate a sparse vector?," Appl. Computat. Harmon. Anal. (ACHA), vol. 34, no. 2, pp. 317-323, 2013.
39. Z. Liu and L. Vandenberghe, "Interior-point method for nuclear norm approximation with application to system identification," SIAM J. Matrix Anal. Appl., vol. 31, no. 3, pp. 1235-1256, 2009.
40. E. G. Birgin, J. M. Martínez, and M. Raydan, "Nonmonotone spectral projected gradient methods on convex sets," SIAM J. Optimiz., vol. 10, no. 4, pp. 1196-1211, 2000.
41. L. El Ghaoui, Lecture Notes for EE227A: Algorithms for Large-Scale Convex Optimization. Berkeley, CA, USA: Univ. Calif., 2010.
42. J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra, "Efficient projections onto the l 1-ball for learning in high dimensions," in Proc. ACM 25th Int. Conf. on Mach. Learn. (ICML), 2008, pp. 272-279.
43. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
44. Y. Cao and Y. Xie, "Low-rank matrix recovery in Poisson noise," in Proc. IEEE Global Conf. Signal Inf. Proc. (GlobalSIP), 2014, pp. 384-388.
45. P. Jain, P. Netrapalli, and S. Sanghavi, "Low-rank matrix completion using alternating minimization," in Proc. 45th ACM Symp. Theory Comput. (STOC), 2013, pp. 665-674.
46. G. Lerman, M. McCoy, J. A. Tropp, and T. Zhang, "Robust computation of linear models, or how to find a needle in a haystack," 2012, ArXiv:1202.4044 [Online]. Available: http://arxiv.org/abs/1202.4044
47. Y. Xie, J. Huang, and R. Willett, "Change-point detection for highdimensional time series with missing data," IEEE J. Sel. Topics Signal Process., vol. 7, pp. 12-27, Feb. 2013.
48. H. Fanaee-T and J. Gama, "Event labeling combining ensemble detectors and background knowledge," Prog. Artif. Intell., pp. 1-15, 2013.
49. D. Pollard, A User's Guide to Measure Theoretic Probability. Cambridge, U.K.: Cambridge Univ. Press, 2002, vol. 8.
50. J. Canny, Lecture Notes for CS174: Combinatorics and Discrete Probability. Berkeley, CA, USA: Univ. Calif., 2001.
51. M. Ledoux and M. Talagrand, Probability in Banach Spaces: Isoperimetry and Processes. New York, NY, USA: Springer-Verlag, 1991, vol. 23.
52. J. Watrous, Lectures Nots for CS766: Theory of Quantum Information. Waterloo, Canada: Univ. Waterloo, 2011.
53. B. Yu, "Assouad, Fano, and Le Cam," in Festschrift for Lucien Le Cam. New York, NY, USA: Springer-Verlag, 1997, pp. 423-435.