Optimality and sub-optimality of PCA I: Spiked random matrix models
A central problem of random matrix theory is to understand the eigenvalues of spiked random matrix models, introduced by Johnstone, in which a prominent eigenvector (or "spike") is planted into a random matrix. These distributions form natural statistical models for principal component ana...
Main Authors: | Perry, Amelia E. (Author), Wein, Alexander Spence (Author), Bandeira, Afonso S. (Author), Moitra, Ankur (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics,
2020-05-21T20:31:23Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
How robust are reconstruction thresholds for community detection?
by: Moitra, Ankur, et al.
Published: (2018) -
Spectral methods from tensor networks
by: Moitra, Ankur, et al.
Published: (2021) -
An Almost Optimal Algorithm for Computing Nonnegative Rank
by: Moitra, Ankur
Published: (2017) -
Feature selected based on PCA and optimized LMC
by: Xi Ke, et al.
Published: (2021-01-01) -
CUDA Based Speed Optimization of the PCA Algorithm
by: Salih Görgünoğlu, et al.
Published: (2016-05-01)