arXiv · 2409.08384
Noisy Low Rank Column-wise Sensing
Abstract
This letter studies the AltGDmin algorithm for solving the noisy low rank column-wise sensing (LRCS) problem. Our sample complexity guarantee improves upon the best existing one by a factor $\max(r, \log(1/\epsilon))/r$ where $r$ is the rank of the unknown matrix and $\epsilon$ is the final desired accuracy. A second contribution of this work is a detailed comparison of guarantees from all work that studies the exact same mathematical problem as LRCS, but refers to it by different names.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ankit Pratap Singh, Namrata Vaswani. 2024-09-12. Noisy Low Rank Column-wise Sensing. https://arxiv.org/abs/2409.08384
Cite the original work for its findings. Save a collection to share your selection of sources.