Matrix Completion from Noisy Entries

Details Matrix Completion from Noisy Entries Matrix Completion from Noisy Entries

2009-06-11

arxiv.org/abs/0906.2027v2

Computer Science

Learning

22 pages, 3 figures

Scientific paper

Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm introduced by Keshavan et al.(2009), based on a combination of spectral techniques and manifold optimization, that we call here OptSpace. We prove performance guarantees that are order-optimal in a number of circumstances.

Affiliated with

Also associated with

No associations

Rating

Matrix Completion from Noisy Entries 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 Matrix Completion from Noisy Entries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix Completion from Noisy Entries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516165