Weighted algorithms for compressed sensing and matrix completion

Details Weighted algorithms for compressed sensing and matrix completion Weighted algorithms for compressed sensing and matrix completion

2011-07-08

arxiv.org/abs/1107.1638v1

Computer Science

Information Theory

Scientific paper

This paper is about iteratively reweighted basis-pursuit algorithms for compressed sensing and matrix completion problems. In a first part, we give a theoretical explanation of the fact that reweighted basis pursuit can improve a lot upon basis pursuit for exact recovery in compressed sensing. We exhibit a condition that links the accuracy of the weights to the RIP and incoherency constants, which ensures exact recovery. In a second part, we introduce a new algorithm for matrix completion, based on the idea of iterative reweighting. Since a weighted nuclear "norm" is typically non-convex, it cannot be used easily as an objective function. So, we define a new estimator based on a fixed-point equation. We give empirical evidences of the fact that this new algorithm leads to strong improvements over nuclear norm minimization on simulated and real matrix completion problems.

Affiliated with

Also associated with

No associations

Rating

Weighted algorithms for compressed sensing and 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 Weighted algorithms for compressed sensing and matrix completion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted algorithms for compressed sensing and matrix completion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-222392