Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data (Q1688973)
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 meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data |
scientific article |
Statements
Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data (English)
0 references
12 January 2018
0 references
iterative Hessian sketch
0 references
dual random projection
0 references
preconditioning
0 references
primal-dual conversion
0 references
acceleration
0 references
conjugate gradient
0 references
primal-dual sketch
0 references
0.8003247380256653
0 references
0.7911249995231628
0 references
0.7836775779724121
0 references
0.7733810544013977
0 references
0.7651398777961731
0 references
