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 analysis (PCA...
Main Authors: | Perry, Amelia E., Wein, Alexander Spence, Bandeira, Afonso S., Moitra, Ankur |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Institute of Mathematical Statistics
2020
|
Online Access: | https://hdl.handle.net/1721.1/125398 |
Similar Items
-
Message-Passing Algorithms for Synchronization Problems over Compact Groups
by: Perry, Amelia, et al.
Published: (2021) -
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) -
Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares
by: Kim, Chiheon, et al.
Published: (2018) -
An Almost Optimal Algorithm for Computing Nonnegative Rank
by: Moitra, Ankur
Published: (2017)