In:
Biometrika, Oxford University Press (OUP), Vol. 110, No. 2 ( 2023-05-15), p. 339-360
Abstract:
Sparse principal component analysis is an important technique for simultaneous dimensionality reduction and variable selection with high-dimensional data. In this work we combine the unique geometric structure of the sparse principal component analysis problem with recent advances in convex optimization to develop novel gradient-based sparse principal component analysis algorithms. These algorithms enjoy the same global convergence guarantee as the original alternating direction method of multipliers, and can be more efficiently implemented with the rich toolbox developed for gradient methods from the deep learning literature. Most notably, these gradient-based algorithms can be combined with stochastic gradient descent methods to produce efficient online sparse principal component analysis algorithms with provable numerical and statistical performance guarantees. The practical performance and usefulness of the new algorithms are demonstrated in various simulation studies. As an application, we show how the scalability and statistical accuracy of our method enable us to find interesting functional gene groups in high-dimensional RNA sequencing data.
Type of Medium:
Online Resource
ISSN:
0006-3444
,
1464-3510
DOI:
10.1093/biomet/asac041
Language:
English
Publisher:
Oxford University Press (OUP)
Publication Date:
2023
detail.hit.zdb_id:
1119-8
detail.hit.zdb_id:
1470319-1
SSG:
12
Permalink
