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

DOI10.1109/TIT.2023.3273181MaRDI QIDQ6574868zbMATH OpenFDO

Authors Xiaoqi 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

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574868)