pith. sign in

arxiv: 1202.1242 · v1 · pith:CKWOHXJOnew · submitted 2012-02-06 · 🧮 math.ST · stat.ME· stat.TH

Augmented sparse principal component analysis for high dimensional data

classification 🧮 math.ST stat.MEstat.TH
keywords convergenceeigenvectorsleadingunderachievesestablishestimatorrate
0
0 comments X
read the original abstract

We study the problem of estimating the leading eigenvectors of a high-dimensional population covariance matrix based on independent Gaussian observations. We establish lower bounds on the rates of convergence of the estimators of the leading eigenvectors under $l^q$-sparsity constraints when an $l^2$ loss function is used. We also propose an estimator of the leading eigenvectors based on a coordinate selection scheme combined with PCA and show that the proposed estimator achieves the optimal rate of convergence under a sparsity regime. Moreover, we establish that under certain scenarios, the usual PCA achieves the minimax convergence rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Sliding Window Informative Canonical Correlation Analysis

    stat.ML 2025-07 unverdicted novelty 6.0

    SWICCA extends canonical correlation analysis to streaming data by pairing a streaming PCA backend with a sliding window of samples, supported by simulations and a theoretical performance guarantee.