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
Information inequalities for the estimation of principal components.
TL;DR: This work provides lower bounds for the estimation of the eigenspaces of a covariance operator based on a van Trees inequality for equivariant models, with the reference measure being the Haar measure on the orthogonal group.
Posted Content
Spectral thresholding for the estimation of Markov chain transition operators
Matthias Löffler,Antoine Picard +1 more
TL;DR: In this article, the authors investigated the performance of a spectral hard thresholded Galerkin-type estimator for nonparametric estimation of the transition operator of a Markov chain and its transition density.
Posted Content
Perturbation bounds for eigenspaces under a relative gap condition.
Moritz Jirak,Martin Wahl +1 more
TL;DR: In this article, the authors prove upper bounds for the subspace distance, taylored for structured random perturbations, for the empirical covariance operator, and show that a sharp bound can be achieved under a relative gap condition.
Journal ArticleDOI
Heterogeneity adjustment with applications to graphical model inference.
TL;DR: In this article, a generic framework called Adaptive Low-rank Principal Heterogeneity Adjustment (ALPHA) is proposed to model, estimate, and adjust heterogeneity from the original data, which can remove the batch effects and enhance the inferential power by aggregating the homogeneous residuals from multiple sources.
Posted Content
Geometrizing Local Rates of Convergence for Linear Inverse Problems
TL;DR: In this article, a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model is presented, which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix estimation, and noisy matrix completion.
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.