论文信息 - Nonparametric low-rank tensor imputation

Nonparametric low-rank tensor imputation

Completion or imputation of three-way data arrays with missing entries is a basic problem encountered in various areas, including bio-informatics, image processing, and preference analysis. If available, prior information about the data at hand should be incorporated to enhance performance of the imputation method adopted. This is the motivation behind the proposed low-rank tensor estimator which leverages the correlation across slices of the data cube in the form of reproducing kernels. The rank of the tensor estimate is controlled by a novel regularization on the factors of its PARAFAC decomposition. Such a regularization is inspired by a reformulation of the nuclear norm for matrices, which allows to bypass the challenge that rank and singular values of tensors are unrelated quantities. The proposed technique is tested on MRI data of the brain with 30% missing data, resulting in a recovery error of -17dB.

Gonzalo Mateos | Georgios B. Giannakis | Juan Andrés Bazerque

[1] J. Berge,et al. On uniqueness in candecomp/parafac , 2002 .

[2] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[3] Morteza Mardani,et al. Decentralized Sparsity-Regularized Rank Minimization: Algorithms and Applications , 2012, IEEE Transactions on Signal Processing.

[4] Tamara G. Kolda,et al. Scalable Tensor Factorizations for Incomplete Data , 2010, ArXiv.

[5] Francis R. Bach,et al. A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization , 2008, J. Mach. Learn. Res..

[6] Morteza Mardani,et al. Decentralized Sparsity-Regularized Rank Minimization: Algorithms and Applications , 2012, IEEE Transactions on Signal Processing.

[7] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[8] Tamara G. Kolda,et al. Tensor Decompositions and Applications , 2009, SIAM Rev..

[9] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[10] B. Recht,et al. Tensor completion and low-n-rank tensor recovery via convex optimization , 2011 .

[11] Francis R. Bach,et al. Low-rank matrix factorization with attributes , 2006, ArXiv.

[12] Paul Scheet,et al. A fast and flexible statistical model for large-scale population genotype data: applications to inferring missing genotypes and haplotypic phase. , 2006, American journal of human genetics.