Sparsistency and agnostic inference in sparse PCA
arXiv:1401.6978 · doi:10.1214/14-AOS1273
Abstract
The presence of a sparse "truth" has been a constant assumption in the theoretical analysis of sparse PCA and is often implicit in its methodological development. This naturally raises questions about the properties of sparse PCA methods and how they depend on the assumption of sparsity. Under what conditions can the relevant variables be selected consistently if the truth is assumed to be sparse? What can be said about the results of sparse PCA without assuming a sparse and unique truth? We answer these questions by investigating the properties of the recently proposed Fantope projection and selection (FPS) method in the high-dimensional setting. Our results provide general sufficient conditions for sparsistency of the FPS estimator. These conditions are weak and can hold in situations where other estimators are known to fail. On the other hand, without assuming sparsity or identifiability, we show that FPS provides a sparse, linear dimension-reducing transformation that is close to the best possible in terms of maximizing the predictive covariance.
arXiv commentPublished in at http://dx.doi.org/10.1214/14-AOS1273 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (13)
- High-dimensional graphs and variable selection with the Lasso
- Sparse permutation invariant covariance estimation
- Generalized power method for sparse principal component analysis
- Sparsistency and rates of convergence in large covariance matrix estimation
- Sparse principal component analysis and iterative thresholding
- Sparse PCA: Optimal rates and adaptive estimation
- Optimal detection of sparse principal components in high dimension
- Optimal Solutions for Sparse Principal Component Analysis
- Truncated Power Method for Sparse Eigenvalue Problems
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Minimax sparse principal subspace estimation in high dimensions
- Augmented sparse principal component analysis for high dimensional data
- Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time