Rank regularization and bayesian inference for tensor completion and extrapolation

IEEE Transactions on Signal Processing

Volumn 61, Issue 22, 2013, Pages 5689-5703

  Bazerque, Juan Andres ^a   Mateos, Gonzalo ^a   Giannakis, Georgios B ^a  

^a University of Minnesota   (United States)

Author keywords

Bayesian inference; low rank; missing data; Poisson process; tensor

Indexed keywords

BAYESIAN INFERENCE; GENE EXPRESSION DATASETS; KULLBACK LEIBLER DIVERGENCE; LOW-RANK; MISSING DATA; POISSON PROCESS; PREDICTION CAPABILITY; PROBABILISTIC APPROACHES;

BAYESIAN NETWORKS; GENE EXPRESSION; INFERENCE ENGINES; NEUROIMAGING; PROBABILITY DISTRIBUTIONS;

TENSORS;

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

References (41)

1. J. Abernethy, F. Bach, T. Evgeniou, and J. P. Vert, "A new approach to collaborative filtering: Operator estimation with spectral regularization," J. Mach. Learn. Res., vol. 10, pp. 803-826, 2009.
2. E. Acar, D. M. Dunlavy, T. G. Kolda, and M. Mørup, "Scalable tensor factorizations for incomplete data," Chemometr. Intell. Lab. Syst., vol. 106, no. 1, pp. 41-56, 2011.
3. O. Alter, P. O. Brown, and D. Botstein, "Singular value decomposition for genome-wide expression data processing andmodeling," Proc. Nat. Acad. Sci., vol. 97, no. 18, pp. 10101-10106, 2000.
4. L. Balzano, R. Nowak, and B. Recht, "Online identification and tracking of subspaces from highly incomplete information," in Proc. Allerton Conf. Commun., Contr., Comput., Monticello, Jun. 2010.
5. J. A. Bazerque, G. Mateos, and G. B. Giannakis, "Nonparametric low-rank tensor imputation," in Proc. IEEE Statistical Signal Process. Workshop, Ann Arbor, MI, USA, Aug. 2012, pp. 888-891.
6. J. F. Cai, E. J. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optimiz., vol. 20, pp. 1956-1982, Jan. 2010.
7. E. J. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
8. V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, "The convex geometry of linear inverse problems," Found. Comput. Math., vol. 12, no. 6, Dec. 2012.
9. R. Chartrand, "Exact reconstruction of sparse signals via nonconvex minimization," IEEE Signal Process. Lett., vol. 14, no. 10, pp. 707-710, Oct. 2007. (Pubitemid 47434090)
10. J. Chen and Y. Saad, "On the tensor SVD and the optimal low-rank othogonal approximation of tensors," SIAM J. Matrix Anal. Appl. (SIMAX), vol. 30, no. 4, pp. 1709-1734, 2009.
11. E. C. Chi and T. G. Kolda, "On tensors, sparsity, and nonnegative factorizations," SIAM J.Matrix Anal. Appl., vol. 33, no. 4, pp. 1272-1299, 2012.
12. Y. Chi, Y. C. Eldar, and R. Calderbank, "PETRELS: Subspace estimation and tracking from partial observations," in Proc. IEEE Int. Conf. on Acoust., Speech Signal Process., Kyoto, Japan, Mar. 2012.
13. A. Cichocki, R. Zdunek, A.-H. Phan, and S. Amari, Nonnegative Matrix and Tensor Factorizations: Applications to ExploratoryMulti-Way Data Analysis. New York, NY, USA: Wiley, 2009.
14. M. Fazel, "Matrix Rank Minimization with Applications," PhD, Stanford Univ., Elect. Eng. Dep., Stanford, CA, USA, 2002.
15. S. Gandy, B. Recht, and I. Yamada, "Tensor completion and low-n-rank tensor recovery via convex optimization," Inverse Problems, vol. 27, no. 2, pp. 1-19, 2011.
16. J. S. Goldstein, I. S. Reed, and L. L. Scharf, "A multistage representation of theWiener filter based on orthogonal projections," IEEE Trans. Inf. Theory, vol. 44, no. 7, pp. 2943-2959, Jul. 1998. (Pubitemid 128739997)
17. G. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD, USA: Johns Hopkins Univ.Press, 1996.
18. J. Håstad, "Tensor rank is NP-complete," J. Algorithms, vol. 11, no. 4, pp. 644-654, 1990.
19. Internet Brain Segmentation Repository, "MR Brain Data Set 657" Center for Morphometric Analysis at Massachusetts General Hospital [Online]. Available: http://www.cma.mgh.harvard.edu/ibsr/
20. S. M. Kay, Fundamental of Statistical Signal Processing: Estimation Theory. Englewood Cliffs, NJ, USA: Prentice-Hall, 1993.
21. T. G. Kolda and B. W. Bader, "Tensor decompositions and applications," SIAM Rev., vol. 51, no. 3, pp. 455-500, 2009.
22. J. Kruskal, "Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics," Linear Alg. Appl., vol. 18, no. 2, pp. 95-138, 1977.
23. D. D. Lee and H. S. Seung, "Learning the parts of objects by nonnegative matrix factorization," Nature, vol. 401, pp. 788-791, 1999.
24. M. Mardani, G. Mateos, and G. B. Giannakis, "Decentralized sparsity-regularized rank minimization: Algorithms and application," IEEE Trans. Signal Process., vol. 61, no. 1, pp. 5374-5388, Nov. 1, 2013.
25. M. Mardani, G. Mateos, and G. B. Giannakis, "Rank minimization for subspace tracking from incomplete data," in Proc. IEEE Int. Conf. on Acoust., Speech Signal Process., Vancouver, Canada, May 2013, pp. 5681-5685.
26. U. Nagalakshmi et al., "The transcriptional landscape of the yeast genome defined by RNA sequencing," Science, vol. 320, no. 5881, pp. 1344-1349, Jun. 2008. (Pubitemid 351929471)
27. M. Z. Nashed and Q. Sun, "Function spaces for sampling expansions," in Multiscale Signal Analysis and Modelling, X. Shen and A. Zayed, Eds. New York, NY, USA: Springer-Verlag, 2012, Lecture Notes in EE, pp. 81-104.
28. C. E. Rasmussen and C. K. I. Williams, Gaussian Processes for Machine Learning. Cambridge, MA, USA: The MIT Press, 2006.
29. M. Razaviyayn, M. Hong, and Z.-Q. Luo, "A unified convergence analysis of block successive minimization methods for nonsmooth optimization," SIAM J. Opt., 2012.
30. B. Recht and C. Re, "Parallel stochastic gradient algorithms for largescale matrix completion," Math. Programm. Comput., vol. 5, no. 2, pp. 201-226, 2013.
31. P. Scheet and M. Stephens, "A fast and flexible statistical model for large-scale population genotype data: Applications to inferringmissing genotypes and haplotypic phase," Amer. J. Human Genet., vol. 78, pp. 629-644, 2006.
32. N. D. Sidiropoulos and R. Bro, "On the uniqueness of multilinear decomposition of N-way arrays," J. Chemometr., vol. 14, no. 3, pp. 229-239, 2000.
33. N. D. Sidiropoulos, R. Bro, and G. B. Giannakis, "Parallel factor analysis in sensor array processing," IEEE Trans. Signal Process., vol. 48, no. 8, pp. 2377-2388, Aug. 2000.
34. N. D. Sidiropoulos, G. B. Giannakis, and R. Bro, "Blind PARAFAC receivers for DS-CDMA systems," IEEE Trans. Signal Process., vol. 48, no. 3, pp. 810-823, Mar. 2000. (Pubitemid 30576249)
35. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola, "Maximum-margin matrix factorization," Adv. Neural Inf. Process. Syst., vol. 17, pp. 1329-1336, 2005.
36. A. Stegeman and N. D. Sidiropoulos, "On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition," Linear Algebra Appl., vol. 420, no. 2, pp. 540-552, 2007. (Pubitemid 44751783)
37. J. M. F. ten Berge and N. D. Sidiropoulos, "On uniqueness in CANDECOMP/PARAFAC," Psychometrika, vol. 67, no. 3, pp. 399-409, 2002.
38. R. Tomioka, K. Hayashi, and H. Kashima, Estimation of Low-Rank Tensors via Convex Optimization 2011 [Online]. Available: arXiv:1010.0789v2 [stat.ML], submitted for publication
39. L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Rev., vol. 38, no. 1, pp. 49-95, 1996. (Pubitemid 126610912)
40. G. Wahba, Spline Models for Observational Data. Philadelphia, PA, USA: SIAM, 1990.
41. M. Welling and M. Weber, "Positive tensor factorization," Pattern Recogn. Lett., vol. 22, pp. 1255-1261, 2001. (Pubitemid 32784358)