Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison

Details Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison Low-rank Matrix Completion with Noisy Observations: a Quantitative Comparison

2009-10-06

arxiv.org/abs/0910.0921v2

Computer Science

Learning

7 pages, 7 figures, 47th Allerton Conference on Communication Control and Computing, 2009, invited paper

Scientific paper

We consider a problem of significant practical importance, namely, the reconstruction of a low-rank data matrix from a small subset of its entries. This problem appears in many areas such as collaborative filtering, computer vision and wireless sensor networks. In this paper, we focus on the matrix completion problem in the case when the observed samples are corrupted by noise. We compare the performance of three state-of-the-art matrix completion algorithms (OptSpace, ADMiRA and FPCA) on a single simulation platform and present numerical results. We show that in practice these efficient algorithms can be used to reconstruct real data matrices, as well as randomly generated matrices, accurately.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357373