Matrix Completion via Successive Low-rank Matrix Approximation

EAI Endorsed Transactions on Scalable Information Systems

article

Jin Wang¹  Zeyao Mo² 

[1] Institute of Applied Physics and Computational Mathematics;China Academy of Engineering Physics

关键词: matrix completion;    low-rank matrix approximation;    hard thresholding;   

DOI  :  10.4108/eetsis.v10i3.2878

学科分类：社会科学、人文和艺术（综合）

来源: Bern Open Publishing

【 摘 要 】

In this paper, a successive low-rank matrix approximation algorithm is presented for the matrix completion (MC) based on hard thresholding method, which approximate the optimal low-rank matrix from rank-one matrix step by step. The algorithm enables the distance between the matrix with the observed elements and the projection on low-rank manifold to be minimum. The optimal low-rank matrix with observed elements is obtained when the distance is zero. In theory, convergence and convergent error of the new algorithm are analyzed in detail. Furthermore, some numerical experiments show that the algorithm is more effective in CPU time and precision than the orthogonal rank-one matrix pursuit(OR1MP) algorithm and the augmented Lagrange multiplier (ALM) method when the sampling rate is low.

【 授权许可】

CC BY