The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Sparse PCA: Optimal rates and adaptive estimation
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
An Introduction to Multivariate Statistical Analysis
Muirhead, R. J., & Anderson, T. W. (1986) · Journal of Business & Economic Statistics · doi:10.2307/1391399 · Cited by 9,082
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
An Introduction to Multivariate Statistical Analysis.
Skinner, C. J., & Anderson, T. W. (1985) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981950 · Cited by 3,245
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Introduction to Nonparametric Estimation
Tsybakov, A. B. (2009) · Springer Series in Statistics · doi:10.1007/b13794 · Cited by 2,486
On the distribution of the largest eigenvalue in principal components analysis
Johnstone, I. M. (2001) · The Annals of Statistics · doi:10.1214/aos/1009210544 · Cited by 1,949
Witten, D. M., Tibshirani, R., & Hastie, T. (2009) · Biostatistics · doi:10.1093/biostatistics/kxp008 · Cited by 1,535
Cited by
A useful variant of the Davis–Kahan theorem for statisticians
Yu, Y., Wang, T., & Samworth, R. J. (2015) · Biometrika · doi:10.1093/biomet/asv008 · Cited by 441
An overview of the estimation of large covariance and precision matrices
Fan, J., Liao, Y., & Liu, H. (2016) · The Econometrics Journal · doi:10.1111/ectj.12061 · Cited by 385
Robust covariance and scatter matrix estimation under Huber’s contamination model
Chen, M., Gao, C., & Ren, Z. (2018) · The Annals of Statistics · doi:10.1214/17-aos1607 · Cited by 146
Subspace Estimation from Unbalanced and Incomplete Data Matrices: 𝓁2, ∞ Statistical Guarantees
Cai, C., Li, G., Chi, Y., Poor, H. V., & Chen, Y. (2021) · The Annals of Statistics · doi:10.1214/20-aos1986 · Cited by 37
Sparse principal component analysis for high-dimensional stationary time series
Fujimori, K., Goto, Y., Liu, Y., & Taniguchi, M. (2023) · Scandinavian Journal of Statistics · doi:10.1111/sjos.12664 · Cited by 7
Metadata
- Authors
- Cai, T. T., Ma, Z., & Wu, Y.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2013-12-01
- Volume
- 41
- Issue
- 6
- Pages
- 3074-3110
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2035076036
- Cited by
- 283
- References
- 61
- FWCI
- 22.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparse PCA: Optimal rates and adaptive estimation. https://app.cochat.ai/papers/10.1214/13-aos1178
- The paper
- Cai, T. T., Ma, Z., & Wu, Y. (2013). Sparse PCA: Optimal rates and adaptive estimation. The Annals of Statistics. https://doi.org/10.1214/13-aos1178
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.