Concentration-Based Guarantees for Low-Rank Matrix Reconstruction

Details Concentration-Based Guarantees for Low-Rank Matrix Reconstruction Concentration-Based Guarantees for Low-Rank Matrix Reconstruction

2011-02-18

arxiv.org/abs/1102.3923v2

Computer Science

Learning

Scientific paper

We consider the problem of approximately reconstructing a partially-observed, approximately low-rank matrix. This problem has received much attention lately, mostly using the trace-norm as a surrogate to the rank. Here we study low-rank matrix reconstruction using both the trace-norm, as well as the less-studied max-norm, and present reconstruction guarantees based on existing analysis on the Rademacher complexity of the unit balls of these norms. We show how these are superior in several ways to recently published guarantees based on specialized analysis.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159067