{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:40:37Z","timestamp":1782441637513,"version":"3.54.5"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2023,2,24]],"date-time":"2023-02-24T00:00:00Z","timestamp":1677196800000},"content-version":"vor","delay-in-days":1123,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,4,1]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully selected axis-aligned random projections of the sample covariance matrix. Unlike most alternative approaches, our algorithm is non-iterative, so it is not vulnerable to a bad choice of initialization. We provide theoretical guarantees under which our principal subspace estimator can attain the minimax optimal rate of convergence in polynomial time. In addition, our theory provides a more refined understanding of the statistical and computational trade-off in the problem of sparse principal component estimation, revealing a subtle interplay between the effective sample size and the number of random projections that are required to achieve the minimax optimal rate. Numerical studies provide further insight into the procedure and confirm its highly competitive finite sample performance.<\/jats:p>","DOI":"10.1111\/rssb.12360","type":"journal-article","created":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T22:28:34Z","timestamp":1580250514000},"page":"329-359","source":"Crossref","is-referenced-by-count":19,"title":["Sparse Principal Component Analysis via Axis-Aligned Random Projections"],"prefix":"10.1093","volume":"82","author":[{"given":"Milana","family":"Gataric","sequence":"first","affiliation":[{"name":"University of Cambridge \u00a0 UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tengyao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Cambridge \u00a0 UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard J.","family":"Samworth","sequence":"additional","affiliation":[{"name":"University of Cambridge \u00a0 UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2020,1,28]]},"reference":[{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","article-title":"Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays","volume":"96","author":"Alon","year":"1999","journal-title":"Proc. Natn. Acad. Sci. USA"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1214\/08-AOS664","article-title":"High-dimensional analysis of semidefinite relaxations for sparse principal components","volume":"37","author":"Amini","year":"2009","journal-title":"Ann. Statist."},{"key":"2023022408363670000_","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019Aspremont","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"2023022408363670000_","first-page":"41","article-title":"A direct formulation for sparse PCA using semidefinite programming","volume":"16","author":"d\u2019Aspremont","year":"2007","journal-title":"Adv. Neurl Inform. Process. Syst."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"3074","DOI":"10.1214\/13-AOS1178","article-title":"Sparse PCA: optimal rates and adaptive estimation","volume":"41","author":"Cai","year":"2013","journal-title":"Ann. Statist."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1111\/rssb.12228","article-title":"Random-projection ensemble classification (with discussion)","volume":"79","author":"Cannings","year":"2017","journal-title":"J. R. Statist. Soc."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIP.2009.2025089","article-title":"Compressive-projection principal component analysis","volume":"18","author":"Fowler","year":"2009","journal-title":"IEEE Trans. Im. Process."},{"key":"2023022408363670000_","volume-title":"SPCAvRP: sparse principal component analysis via random projections","author":"Gataric","year":"2018"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1198\/jasa.2009.0121","article-title":"On consistency and sparsity for principal components analysis in high dimensions","volume":"104","author":"Johnstone","year":"2009","journal-title":"J. Am. Statist. Ass."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1198\/1061860032148","article-title":"A modified principal component technique based on the LASSO","volume":"12","author":"Jolliffe","year":"2003","journal-title":"J. Computnl Graph. Statist."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1214\/13-AOS1097","article-title":"Sparse principal component analysis and iterative thresholding","volume":"41","author":"Ma","year":"2013","journal-title":"Ann. Statist."},{"key":"2023022408363670000_","first-page":"1017","article-title":"Deflation methods for sparse PCA","volume":"21","author":"Mackey","year":"2009","journal-title":"Adv. Neurl Inform. Process. Syst."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"6256","DOI":"10.1109\/TIT.2011.2162175","article-title":"A random matrix-theoretic approach to handling singular covariance estimates","volume":"57","author":"Marzetta","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023022408363670000_","volume-title":"Concentration Inequalities and Model Selection","author":"Massart","year":"2007"},{"key":"2023022408363670000_","first-page":"915","article-title":"Spectral bounds for sparse PCA: exact and greedy algorithms","volume":"18","author":"Moghaddam","year":"2006","journal-title":"Adv. Neurl Inform. Process. Syst."},{"key":"2023022408363670000_","volume-title":"Convex Geometric Analysis","author":"Pajor","year":"1998"},{"key":"2023022408363670000_","first-page":"1617","article-title":"Asymptotics of sample eigenstructure for a large dimensional spiked covariance model","volume":"17","author":"Paul","year":"2007","journal-title":"Statist. Sin."},{"key":"2023022408363670000_","volume-title":"Augmented sparse principal component analysis for high dimensional data","author":"Paul","year":"2012"},{"key":"2023022408363670000_","first-page":"1341","volume-title":"Proc. Int. Conf. Machine Learning 31","author":"Pourkamali-Anaraki","year":"2014"},{"key":"2023022408363670000_","first-page":"937","volume-title":"Proc. Int. Conf. Image Processing 19","author":"Qi","year":"2012"},{"key":"2023022408363670000_","volume-title":"Collection of data sets for classification","author":"Ramey","year":"2016"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","article-title":"Sparse principal component analysis via regularized low rank matrix approximation","volume":"99","author":"Shen","year":"2008","journal-title":"J. Multiv. Anal."},{"key":"2023022408363670000_","volume-title":"Matrix Perturbation Theory","author":"Stewart","year":"1990"},{"key":"2023022408363670000_","first-page":"169","volume-title":"Proc. Research Wrkshp Banach Space Theory, Iowa City, 1981","author":"Szarek","year":"1982"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/TIT.2013.2290112","article-title":"The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing","volume":"60","author":"Tillman","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023022408363670000_","first-page":"2670","article-title":"Fantope projection and selection: a near-optimal convex relaxation of sparse PCA","volume":"26","author":"Vu","year":"2013","journal-title":"Adv. Neurl Inform. Process. Syst."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1214\/13-AOS1151","article-title":"Minimax sparse principal subspace estimation in high dimensions","volume":"41","author":"Vu","year":"2013","journal-title":"Ann. Statist."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"1896","DOI":"10.1214\/15-AOS1369","article-title":"Statistical and computational trade-offs in estimation of sparse principal components","volume":"44","author":"Wang","year":"2016","journal-title":"Ann. Statist."},{"key":"2023022408363670000_","first-page":"3383","article-title":"Tighten after relax: minimax-optimal sparse PCA in polynomial time","volume":"27","author":"Wang","year":"2014","journal-title":"Adv. Neurl Inform. Process. Syst."},{"key":"2023022408363670000_","first-page":"28","article-title":"The generalization of \u201cStudent\u2019s\u201d problem when several different population variances are involved","volume":"34","author":"Welch","year":"1947","journal-title":"Biometrika"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01456804","article-title":"Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf der Theorie der Hohlraumstrahlung)","volume":"71","author":"Weyl","year":"1912","journal-title":"Math. Ann."},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","article-title":"A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis","volume":"10","author":"Witten","year":"2009","journal-title":"Biostatistics"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-1-4612-1880-7_29","volume-title":"Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics","author":"Yu","year":"1997"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/biomet\/asv008","article-title":"A useful variant of the Davis\u2013Kahan theorem for statisticians","volume":"102","author":"Yu","year":"2015","journal-title":"Biometrika"},{"key":"2023022408363670000_","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","article-title":"Sparse principal components analysis","volume":"15","author":"Zou","year":"2006","journal-title":"J. Computnl Graph. Statist."}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Frssb.12360","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/82\/2\/329\/49322065\/jrsssb_82_2_329.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/82\/2\/329\/49322065\/jrsssb_82_2_329.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T20:55:57Z","timestamp":1695675357000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/82\/2\/329\/7056126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,28]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,1,28]]},"published-print":{"date-parts":[[2020,4,1]]}},"URL":"https:\/\/doi.org\/10.1111\/rssb.12360","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,4]]},"published":{"date-parts":[[2020,1,28]]}}}