Statistical and computational trade-offs in estimation of sparse principal components (Q342660): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1408.5369 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3104095169 / rank | |||
Normal rank |
Latest revision as of 10:28, 30 July 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