An adaptive correction approach for tensor completion

In this paper, we study the tensor completion problem on recovery of the multilinear data under limited sampling. A popular convex relaxation of this problem is to minimize the nuclear norm of the more square matrix produced by matricizing a tensor. However, it may fail to produce a highly accurate solution under low sample ratio. In order to get a recovery with high accuracy, we propose an adaptive correction approach for tensor completion. First, a corrected model for matrix completion with bound constraint is proposed and its error bound is established. Then, we extend it to tensor completion with bound constraint and propose a corrected model for tensor completion. The adaptive correction approach consists of solving a series of corrected models with an initial estimator where the initial estimator used for the next step is computed from the value of the current solution. Moreover, the error bound of the corrected model for tensor completion is also established. A convergent 3-block alternating direction method of multipliers (ADMM) is applied to solve the dual problem of the corrected model. Numerical experiments on both random data and real world data validate the effciency of our proposed correction approach.