Noisy Low Rank Column-wise Sensing
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916660903936000 |
|---|---|
| author | Singh, Ankit Pratap Vaswani, Namrata |
| author_facet | Singh, Ankit Pratap Vaswani, Namrata |
| contents | 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/ε))/r$ where $r$ is the rank of the unknown matrix and $ε$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_08384 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Noisy Low Rank Column-wise Sensing Singh, Ankit Pratap Vaswani, Namrata Signal Processing Machine Learning 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/ε))/r$ where $r$ is the rank of the unknown matrix and $ε$ 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. |
| title | Noisy Low Rank Column-wise Sensing |
| topic | Signal Processing Machine Learning |
| url | https://arxiv.org/abs/2409.08384 |