Skip to main content

Maximum Entropy Low-Rank Matrix Recovery

Publication ,  Conference
Mak, S; Xie, Y
Published in: IEEE International Symposium on Information Theory Proceedings
August 15, 2018

We propose a novel, information-theoretic mask construction method, called MaxEnt, for efficient data acquisition for low-rank matrix recovery. Fundamental to this design approach is the maximum entropy principle, which states that the measurement masks which maximize the entropy of observations also maximize the information gain on the unknown matrix X. Coupled with a low-rank stochastic model for X, such a principle (i) reveals novel connections between information-theoretic sampling, compressive sensing and coding theory, and (ii) yields efficient mask construction algorithms for recovering X, which significantly outperform random measurements. We demonstrate the usefulness of MaxEnt in two real-world applications on image recovery and text document indexing1.

Duke Scholars

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

ISSN

2157-8095

Publication Date

August 15, 2018

Volume

2018-June

Start / End Page

361 / 365
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Mak, S., & Xie, Y. (2018). Maximum Entropy Low-Rank Matrix Recovery. In IEEE International Symposium on Information Theory Proceedings (Vol. 2018-June, pp. 361–365). https://doi.org/10.1109/ISIT.2018.8437748
Mak, S., and Y. Xie. “Maximum Entropy Low-Rank Matrix Recovery.” In IEEE International Symposium on Information Theory Proceedings, 2018-June:361–65, 2018. https://doi.org/10.1109/ISIT.2018.8437748.
Mak S, Xie Y. Maximum Entropy Low-Rank Matrix Recovery. In: IEEE International Symposium on Information Theory Proceedings. 2018. p. 361–5.
Mak, S., and Y. Xie. “Maximum Entropy Low-Rank Matrix Recovery.” IEEE International Symposium on Information Theory Proceedings, vol. 2018-June, 2018, pp. 361–65. Scopus, doi:10.1109/ISIT.2018.8437748.
Mak S, Xie Y. Maximum Entropy Low-Rank Matrix Recovery. IEEE International Symposium on Information Theory Proceedings. 2018. p. 361–365.

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

ISSN

2157-8095

Publication Date

August 15, 2018

Volume

2018-June

Start / End Page

361 / 365