Sparse Bayesian Methods for Low-Rank Matrix Estimation

Details Sparse Bayesian Methods for Low-Rank Matrix Estimation Sparse Bayesian Methods for Low-Rank Matrix Estimation

2011-02-25

arxiv.org/abs/1102.5288v2

Statistics

Machine Learning

This paper has been withdrawn by the author due to significant revisions in the paper. The new version will be uploaded soon

Scientific paper

Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. A number of methods have been developed for this recovery problem. However, a principled method for choosing the unknown target rank is generally not provided. In this paper, we present novel recovery algorithms for estimating low-rank matrices in matrix completion and robust principal component analysis based on sparse Bayesian learning (SBL) principles. Starting from a matrix factorization formulation and enforcing the low-rank constraint in the estimates as a sparsity constraint, we develop an approach that is very effective in determining the correct rank while providing high recovery performance. We provide connections with existing methods in other similar problems and empirical results and comparisons with current state-of-the-art methods that illustrate the effectiveness of this approach.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-710188