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]

@article{LiuV23-2,
  title = {Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing},
  author = {Xiaoqi Liu and Ramji Venkataramanan},
  year = {2023},
  month = {September},
  doi = {10.1109/TIT.2023.3273181},
  url = {https://doi.org/10.1109/TIT.2023.3273181},
  researchr = {https://researchr.org/publication/LiuV23-2},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {69},
  number = {9},
  pages = {6071-6097},
}