Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1306.3690 / rank | |||
Normal rank | |||
Revision as of 05:39, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Do semidefinite relaxations solve sparse PCA up to the information limit? |
scientific article |
Statements
Do semidefinite relaxations solve sparse PCA up to the information limit? (English)
0 references
6 July 2015
0 references
principal component analysis
0 references
spectral analysis
0 references
spiked covariance ensembles
0 references
sparsity
0 references
high-dimensional statistics
0 references
convex relaxation
0 references
semidefinite programming
0 references
Wishart ensembles
0 references
random matrices
0 references
integrality gap
0 references
