Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing (Q6574868)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing |
scientific article; zbMATH DE number 7883352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing |
scientific article; zbMATH DE number 7883352 |
Statements
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing (English)
0 references
19 July 2024
0 references
two-stage iterative algorithm
0 references
low-rank matrix with \(k\)-sparse singular vectors
0 references
nonasymptotic bound
0 references
probability of exact recovery
0 references
