Tensor Completion via Tensor QR Decomposition and L_2,1-Norm Minimization

11/09/2020 ∙ by Yongming Zheng, et al. ∙ 0

In this paper, we consider the tensor completion problem, which has many researchers in the machine learning particularly concerned. Our fast and precise method is built on extending the L_2,1-norm minimization and Qatar Riyal decomposition (LNM-QR) method for matrix completions to tensor completions, and is different from the popular tensor completion methods using the tensor singular value decomposition (t-SVD). In terms of shortening the computing time, t-SVD is replaced with the method computing an approximate t-SVD based on Qatar Riyal decomposition (CTSVD-QR), which can be used to compute the largest r (r>0 ) singular values (tubes) and their associated singular vectors (of tubes) iteratively. We, in addition, use the tensor L_2,1-norm instead of the tensor nuclear norm to minimize our model on account of it is easy to optimize. Then in terms of improving accuracy, ADMM, a gradient-search-based method, plays a crucial part in our method. Numerical experimental results show that our method is faster than those state-of-the-art algorithms and have excellent accuracy.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 15

page 17

page 20

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.