Repository logo
 

Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing

Accepted version
Peer-reviewed

Repository DOI


Type

Article

Change log

Description

Keywords

Message passing algorithms, sparse graph codes, peeling decoder, low-rank matrix estimation, compressed sensing

Journal Title

IEEE Transactions on Information Theory

Conference Name

Journal ISSN

0018-9448
1557-9654

Volume Title

Publisher

Institute of Electrical and Electronics Engineers (IEEE)