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
Bridging Convex and Nonconvex Optimization in Robust PCA: Noise, Outliers, and Missing Data
TL;DR: This paper delivers improved theoretical guarantees for the convex programming approach in low-rank matrix estimation, in the presence of (1) random noise, (2) gross sparse outliers, and (3) missing data.
Posted Content
De-biased sparse PCA: Inference and testing for eigenstructure of large covariance matrices
Jana Janková,Sara van de Geer +1 more
TL;DR: In this paper, the authors proposed confidence intervals for individual loadings and for the largest eigenvalue of the population covariance matrix for sparse principal component analysis (sPCA).
Posted Content
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
Ming Yu,Varun Gupta,Mladen Kolar +2 more
TL;DR: This work proposes a GDT (Gradient Descent with hard Thresholding) algorithm to efficiently recover matrices with such structure, by minimizing a bi-convex function over a non Convex set of constraints, and shows linear convergence of the iterates obtained by GDT to a region within statistical error of an optimal solution.
Posted Content
Efficient Estimation of Linear Functionals of Principal Components
TL;DR: In this article, the authors studied principal component analysis (PCA) for mean zero i.i.d. Gaussian observations in a separable Hilbert space with unknown covariance operator and developed a method of bias reduction in the problem of estimation of linear functionals of eigenvectors.
Posted Content
ECA: High Dimensional Elliptical Component Analysis in non-Gaussian Distributions
TL;DR: Theoretically, both nonasymptotic and asymptotic analyses quantifying the theoretical performances of ECA are provided, and it is shown that ECA’s performance is highly related to the effective rank of the covariance matrix.
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.