Statistical and computational trade-offs in estimation of sparse principal components (Q342660)
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 6654456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistical and computational trade-offs in estimation of sparse principal components |
scientific article; zbMATH DE number 6654456 |
Statements
Statistical and computational trade-offs in estimation of sparse principal components (English)
0 references
18 November 2016
0 references
computational lower bounds
0 references
planted clique problem
0 references
polynomial time algorithm
0 references
sparse principal component analysis
0 references
0.8761195540428162
0 references
0.8588681221008301
0 references
0.8275658488273621
0 references
0.8263072967529297
0 references
0.8253824710845947
0 references
