A fast automatic low-rank determination algorithm for noisy matrix completion

Rank estimation is an important factor for low-rank based matrix completion, and most works devoted to this problem have considered the minimization of nuclear norm instead of matrix rank. However, when nuclear norm minimization shifts to `regularization' due to noise, it is difficult to estimate original matrix rank, precisely. In present paper, we propose a new fast algorithm to precisely estimate matrix rank and perform completion without using nuclear norm. In our extensive experiments, the proposed algorithm significantly outperformed nuclear-norm based method for accuracy, especially and Incremental OptSpace regarding computational time. Our model selection scheme has many promising extensions for constrained matrix factorizations and tensor decompositions, and these extensions could be useful for wide range of practical applications.

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

[2]  Sewoong Oh,et al.  A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion , 2009, ArXiv.

[3]  Wei Li,et al.  Non‐Local Image Inpainting Using Low‐Rank Matrix Completion , 2014, Comput. Graph. Forum.

[4]  J. Chang,et al.  Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .

[5]  R. Tibshirani,et al.  A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. , 2009, Biostatistics.

[6]  Shiqian Ma,et al.  Fixed point and Bregman iterative methods for matrix rank minimization , 2009, Math. Program..

[7]  Yukihiko Yamashita,et al.  Smooth nonnegative matrix and tensor factorizations for robust multi-way data analysis , 2015, Signal Process..

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

[9]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[10]  Guangdong Feng,et al.  A Tensor Based Method for Missing Traffic Data Completion , 2013 .

[11]  Erkki Oja,et al.  Independent Component Analysis Aapo Hyvärinen, Juha Karhunen, , 2004 .

[12]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[13]  M. Brand,et al.  Fast low-rank modifications of the thin singular value decomposition , 2006 .

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

[15]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[16]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.

[17]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[18]  Seungjin Choi,et al.  Independent Component Analysis , 2009, Handbook of Natural Computing.