Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing

DOI10.1109/tit.2023.3273181zbMath1547.9411MaRDI QIDQ6574868

Xiao-Qi Liu, Ramji Venkataramanan

Publication date: 19 July 2024

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

nonasymptotic boundlow-rank matrix with \(k\)-sparse singular vectorsprobability of exact recoverytwo-stage iterative algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of graph theory (05C90) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

This page was built for publication: Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing