Minimax bounds for sparse PCA with noisy high-dimensional data

Aharon Birnbaum, Iain M. Johnstone, Boaz Nadler, Debashis Paul

Research output: Contribution to journalArticlepeer-review

Abstract

We study the problem of estimating the leading eigenvectors of a highdimensional population covariance matrix based on independent Gaussian observations. We establish a lower bound on the minimax risk of estimators under the l2 loss, in the joint limit as dimension and sample size increase to infinity, under various models of sparsity for the population eigenvectors. The lower bound on the risk points to the existence of different regimes of sparsity of the eigenvectors. We also propose a new method for estimating the eigenvectors by a two-stage coordinate selection scheme.

Original languageEnglish
Pages (from-to)1055-1084
Number of pages30
JournalAnnals of Statistics
Volume41
Issue number3
DOIs
StatePublished - Jun 2013

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Minimax bounds for sparse PCA with noisy high-dimensional data'. Together they form a unique fingerprint.

Cite this