Low-rank matrix completion with geometric performance guarantees

Citations Over Time

Abstract

The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist several low-complexity algorithms for low-rank matrix completion which focus on the minimization of the Frobenius norm of the matrix projection residue. This optimization framework has inherent difficulties: the objective function is not continuous and the solution set is not closed. To address this problem, we propose a geometric objective function to replace the Frobenius norm: the new objective function is continuous everywhere and the solution set is the closure of the solution set of the Frobenius metric. Furthermore, using the geometric objective function and a simple gradient descent procedure, we are able to preclude the existence of local minimizers, and hence establish strong performance guarantees for special completion scenarios, which do not require matrix incoherence or large matrix size.

Related Papers

• → Matrix completion by Truncated Nuclear Norm Regularization(2012)166 cited
• → Joint Schatten $$p$$ p -norm and $$\ell _p$$ ℓ p -norm robust matrix completion for missing value recovery(2013)141 cited
• → Structured low-rank matrix completion for forecasting in time series analysis(2018)1 cited
• → A Riemannian rank-adaptive method for low-rank matrix completion(2021)2 cited
• → Structured low-rank matrix completion for forecasting in time series\n analysis(2018)28 cited