Regularization for Matrix Completion

Details Regularization for Matrix Completion Regularization for Matrix Completion

2010-01-02

arxiv.org/abs/1001.0279v1

Statistics

Machine Learning

5 pages, 3 figures, Conference Version

Scientific paper

We consider the problem of reconstructing a low rank matrix from noisy observations of a subset of its entries. This task has applications in statistical learning, computer vision, and signal processing. In these contexts, "noise" generically refers to any contribution to the data that is not captured by the low-rank model. In most applications, the noise level is large compared to the underlying signal and it is important to avoid overfitting. In order to tackle this problem, we define a regularized cost function well suited for spectral reconstruction methods. Within a random noise model, and in the large system limit, we prove that the resulting accuracy undergoes a phase transition depending on the noise level and on the fraction of observed entries. The cost function can be minimized using OPTSPACE (a manifold gradient descent algorithm). Numerical simulations show that this approach is competitive with state-of-the-art alternatives.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233876