NoisyCUR: An algorithm for two-cost budgeted matrix completion (Q6365441)
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: NoisyCUR: An algorithm for two-cost budgeted matrix completion |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NoisyCUR: An algorithm for two-cost budgeted matrix completion |
preprint article from arXiv |
Statements
16 April 2021
0 references
cs.LG
0 references
cs.NA
0 references
math.NA
0 references
Dong Hu
0 references
Alex Gittens
0 references
Malik Magdon-Ismail
0 references
