A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion

Details A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion

2009-10-27

arxiv.org/abs/0910.5260v2

Computer Science

Numerical Analysis

26 pages, 15 figures

Scientific paper

We consider the problem of reconstructing a low-rank matrix from a small subset of its entries. In this paper, we describe the implementation of an efficient algorithm called OptSpace, based on singular value decomposition followed by local manifold optimization, for solving the low-rank matrix completion problem. It has been shown that if the number of revealed entries is large enough, the output of singular value decomposition gives a good estimate for the original matrix, so that local optimization reconstructs the correct matrix with high probability. We present numerical results which show that this algorithm can reconstruct the low rank matrix exactly from a very small subset of its entries. We further study the robustness of the algorithm with respect to noise, and its performance on actual collaborative filtering datasets.

Affiliated with

Also associated with

No associations

Rating

A Gradient Descent Algorithm on the Grassman Manifold for 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 Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717949