Information Theoretic Bounds for Low-Rank Matrix Completion
Information Theory
2016-09-08 v1 Computational Complexity
math.IT
Probability
Abstract
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.
Cite
@article{arxiv.1001.2331,
title = {Information Theoretic Bounds for Low-Rank Matrix Completion},
author = {Sriram Vishwanath},
journal= {arXiv preprint arXiv:1001.2331},
year = {2016}
}