Loading...
Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time
We provide statistical and computational analysis of sparse Principal Component Analysis (PCA) in high dimensions. The sparse PCA problem is highly nonconvex in nature. Consequently, though its global solution attains the optimal statistical rate of convergence, such solution is computationally intr...
Na minha lista:
| Udgivet i: | Adv Neural Inf Process Syst |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2014
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4301447/ https://ncbi.nlm.nih.gov/pubmed/25620858 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|