Consistency of sparse PCA in High Dimension, Low Sample Size contexts

Authors:
Dan Shen;Haipeng Shen;J. S. Marron
Affiliations:
-;-;-
Venue:
Journal of Multivariate Analysis
Year:
2013

Citing 6
Cited 4

Sparse principal component analysis via regularized low rank matrix approximation

Journal of Multivariate Analysis
A Direct Formulation for Sparse PCA Using Semidefinite Programming

SIAM Review
High-dimensional Variable Selection with Sparse Random Projections: Measurement Sparsity and Statistical Efficiency

The Journal of Machine Learning Research
Effective PCA for high-dimension, low-sample-size data with noise reduction via geometric representations

Journal of Multivariate Analysis
Boundary behavior in High Dimension, Low Sample Size asymptotics of PCA

Journal of Multivariate Analysis
Consistency of sparse PCA in High Dimension, Low Sample Size contexts

Journal of Multivariate Analysis

Consistency of sparse PCA in High Dimension, Low Sample Size contexts

Journal of Multivariate Analysis
Truncated power method for sparse eigenvalue problems

The Journal of Machine Learning Research
Editorial: Following the entire solution path of sparse principal component analysis by coordinate-pairwise algorithm

Data & Knowledge Engineering
A robust elastic net approach for feature learning

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse Principal Component Analysis (PCA) methods are efficient tools to reduce the dimension (or number of variables) of complex data. Sparse principal components (PCs) are easier to interpret than conventional PCs, because most loadings are zero. We study the asymptotic properties of these sparse PC directions for scenarios with fixed sample size and increasing dimension (i.e. High Dimension, Low Sample Size (HDLSS)). We consider the previously studied single spike covariance model and assume in addition that the maximal eigenvector is sparse. We extend the existing HDLSS asymptotic consistency and strong inconsistency results of conventional PCA in an entirely new direction. We find a large set of sparsity assumptions under which sparse PCA is still consistent even when conventional PCA is strongly inconsistent. The consistency of sparse PCA is characterized along with rates of convergence. Furthermore, we clearly identify the mathematical boundaries of the sparse PCA consistency, by showing strong inconsistency for an oracle version of sparse PCA beyond the consistent region, as well as its inconsistency on the boundaries of the consistent region. Simulation studies are performed to validate the asymptotic results in finite samples.