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

Xiaoqi Liu, Ramji Venkataramanan. Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing. IEEE Transactions on Information Theory, 69(9):6071-6097, September 2023. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.