Gradient-based sparse principal component analysis with extensions to online learning
From MaRDI portal
Abstract: Sparse principal component analysis (PCA) is an important technique for dimensionality reduction of high-dimensional data. However, most existing sparse PCA algorithms are based on non-convex optimization, which provide little guarantee on the global convergence. Sparse PCA algorithms based on a convex formulation, for example the Fantope projection and selection (FPS), overcome this difficulty, but are computationally expensive. In this work we study sparse PCA based on the convex FPS formulation, and propose a new algorithm that is computationally efficient and applicable to large and high-dimensional data sets. Nonasymptotic and explicit bounds are derived for both the optimization error and the statistical accuracy, which can be used for testing and inference problems. We also extend our algorithm to online learning problems, where data are obtained in a streaming fashion. The proposed algorithm is applied to high-dimensional gene expression data for the detection of functional gene groups.
Cited in
(10)- Online Schatten quasi-norm minimization for robust principal component analysis
- Perturbation scheme for online learning of features: Incremental principal component analysis
- Spatially-Dimension-Adaptive Sparse Grids for Online Learning
- Online learning for matrix factorization and sparse coding
- scientific article; zbMATH DE number 5957285 (Why is no real title available?)
- Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
- scientific article; zbMATH DE number 1569111 (Why is no real title available?)
- Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Sparse and integrative principal component analysis for multiview data
This page was built for publication: Gradient-based sparse principal component analysis with extensions to online learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045146)
