Exact Matrix Completion via Convex Optimization

Abstract

We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen?We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys m ≥ C n 1.2 r log n for some positive numerical constant C, then with very high probability, most n × n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.Communicated by Michael Todd.E.J. Candès ( ) Applied and Computational Mathematics,

Semi-Automatic 2D-to-3D Conversion Using Low-Rank Matrix Recovery

“…In [20], Cand`es et al shows the number of sampled entries must be bigger than a constant, then the low-rank matrix can be perfectly recovered with high probability. Thus, in [2], for each unlabeled pixel, monochrome intensity affinities are used to find all its neighboring labeled pixels, and then it is labeled with the weighted sum of the neighbors' labels.…”

svt: Singular Value Thresholding in MATLAB

“…Examples include matrix completion, regression with matrix covariates, and multivariate response regression. Matrix completion (Candès and Recht 2009;Mazumder, Hastie, and Tibshirani 2010) aims to recover a large matrix of which only a small fraction of entries are observed. The problem has sparked intensive research in recent years and is enjoying a broad range of applications such as personalized recommendation system (ACM SIGKDD and Netflix 2007) and imputation of massive genomics data (Chi, Zhou, Chen, Del Vecchyo, and Lange 2013).…”

Non-convexly constrained image reconstruction from nonlinear tomographic X-ray measurements

“…For matrix models, another powerful non-convex constraint is the rank constraint [41]. By restricting matrices to have a rank of at most K, we in effect constrain the sparsity of the singular values.…”