A Geometric Approach to Low-Rank Matrix Completion

Details A Geometric Approach to Low-Rank Matrix Completion A Geometric Approach to Low-Rank Matrix Completion

2010-06-10

arxiv.org/abs/1006.2086v1

Computer Science

Information Theory

10 pages, 2 figures

Scientific paper

The low-rank matrix completion problem can be succinctly stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. While several low-complexity algorithms for matrix completion have been proposed so far, it remains an open problem to devise search procedures with provable performance guarantees for a broad class of matrix models. The standard approach to the problem, which involves the minimization of an objective function defined using the Frobenius metric, has inherent difficulties: the objective function is not continuous and the solution set is not closed. To address this problem, we consider an optimization procedure that searches for a column (or row) space that is geometrically consistent with the partial observations. The geometric objective function is continuous everywhere and the solution set is the closure of the solution set of the Frobenius metric. We also 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.

Affiliated with

Also associated with

No associations

Rating

A Geometric Approach to Low-Rank Matrix Completion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Geometric Approach to Low-Rank Matrix Completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Geometric Approach to Low-Rank Matrix Completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492581