Sparse PCA: Optimal rates and adaptive estimation
Reads0
Chats0
TLDR
In this paper, the authors considered both minimax and adaptive estimation of the principal subspace in the high dimensional setting and established the optimal rates of convergence for estimating the subspace which are sharp with respect to all the parameters, thus providing a complete characterization of the difficulty of the estimation problem in terms of the convergence rate.Abstract:
Principal component analysis (PCA) is one of the most commonly used statistical procedures with a wide range of applications. This paper considers both minimax and adaptive estimation of the principal subspace in the high dimensional setting. Under mild technical conditions, we first establish the optimal rates of convergence for estimating the principal subspace which are sharp with respect to all the parameters, thus providing a complete characterization of the difficulty of the estimation problem in term of the convergence rate. The lower bound is obtained by calculating the local metric entropy and an application of Fano’s lemma. The rate optimal estimator is constructed using aggregation, which, however, might not be computationally feasible. We then introduce an adaptive procedure for estimating the principal subspace which is fully data driven and can be computed efficiently. It is shown that the estimator attains the optimal rates of convergence simultaneously over a large collection of the parameter spaces. A key idea in our construction is a reduction scheme which reduces the sparse PCA problem to a high-dimensional multivariate regression problem. This method is potentially also useful for other related problems.read more
Citations
More filters
Posted Content
A greedy anytime algorithm for sparse PCA
TL;DR: In this paper, a greedy algorithm for the sparse PCA problem has been proposed to calibrate the invested computational effort with various characteristics of the input at hand and with the available computational resources.
Posted Content
An Efficient and Optimal Method for Sparse Canonical Correlation Analysis
TL;DR: This paper considers the problem of estimating the subspaces spanned by sparse leading canonical correlation directions when the ambient dimensions are high and proposes a computationally efficient two-stage estimation procedure which consists of a convex programming based initialization stage and a group Lasso based refinement stage.
Posted Content
Post-Processed Posteriors for Banded Covariances
TL;DR: In this paper, a post-processed posterior is proposed for banded covariance matrices, where posterior samples are obtained from the conjugate inverse-Wishart posterior which does not satisfy any structural restrictions.
Journal ArticleDOI
Consistent estimation of high-dimensional factor models when the factor number is over-estimated
Matteo Barigozzi,Haeran Cho +1 more
TL;DR: In this paper, the authors proposed new estimators of the factor model based on scaling the entries of the sample eigenvectors, and investigated their performance when applied to risk minimisation of a portfolio of financial time series.
Posted Content
A New Basis for Sparse PCA.
TL;DR: Through three applications---sparse coding of images, analysis of transcriptome sequencing data, and large-scale clustering of Twitter accounts, the usefulness of sparse PCA is demonstrated in exploring modern multivariate data.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Book
Matrix Analysis
Roger A. Horn,Charles R. Johnson +1 more
TL;DR: In this article, the authors present results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrate their importance in a variety of applications, such as linear algebra and matrix theory.
Book
An Introduction to Multivariate Statistical Analysis
TL;DR: In this article, the distribution of the Mean Vector and the Covariance Matrix and the Generalized T2-Statistic is analyzed. But the distribution is not shown to be independent of sets of Variates.
Journal ArticleDOI
Introduction to Multivariate Statistical Analysis.
William G. Madow,T. W. Anderson +1 more
Journal ArticleDOI
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
TL;DR: It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space.