An interpretable bi-branch neural network for matrix completion

The task of recovering a low-rank matrix given an incomplete matrix, also termed as matrix completion, arises in various applications. Methods for matrix completion can be classified into linear and nonlinear approaches. Despite the fact that the linear model provides basic theories ensuring restoring the missing entries with high probability, it has an obvious limitation that latent factors are restricted in the linear subspace. Thus, the nonlinear model has been suggested, which is mainly performed using neural networks. In this paper, a novel and interpretable neural network is developed for matrix completion. Different from existing neural networks whose structure is created by empirical design, the proposed version is devised via unfolding the matrix factorization formulation. Specifically, the two factors decomposed by matrix factorization construct the two branches of the suggested neural network, called bi-branch neural network (BiBNN). The row and column indices of each entry are considered as the input of the BiBNN, while its output is the estimated value of the entry. The training procedure aims to minimize the fit-ting error between all observed entries and their predicted values and then the unknown entries are estimated by inputting their coordinates into the trained network. The BiBNN is compared with state-of-the-art methods, including linear and nonlinear models, in processing synthetic data, image inpainting, and recommender system. Experimental results demonstrate that the BiBNN is superior to the existing approaches in terms of restoration accuracy.