Statistical and computational trade-offs in estimation of sparse principal components (Q342660): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:39, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Statistical and computational trade-offs in estimation of sparse principal components |
scientific article |
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
