Information Theoretic Bounds for Low-Rank Matrix Completion

Details Information Theoretic Bounds for Low-Rank Matrix Completion Information Theoretic Bounds for Low-Rank Matrix Completion

2010-01-14

arxiv.org/abs/1001.2331v1

Computer Science

Information Theory

Scientific paper

This paper studies the low-rank matrix completion problem from an information
theoretic perspective. The completion problem is rephrased as a communication
problem of an (uncoded) low-rank matrix source over an erasure channel. The
paper then uses achievability and converse arguments to present order-wise
optimal bounds for the completion problem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355321