Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors (Q5361828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6784069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors |
scientific article; zbMATH DE number 6784069 |
Statements
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors (English)
0 references
29 September 2017
0 references
random matrices
0 references
semidefinite programming
0 references
sparse recovery
0 references
spectral methods
0 references
tensor decomposition
0 references
tensor principal component analysis
0 references
0.8332919478416443
0 references
0.8118024468421936
0 references
0.779362678527832
0 references
0.7519752979278564
0 references
0.7348260283470154
0 references
