Generalized power method for sparse principal component analysis
From MaRDI portal
Abstract: In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA problem, aimed at extracting a single sparse dominant principal component of a data matrix, or more components at once, respectively. While the initial formulations involve nonconvex functions, and are therefore computationally intractable, we rewrite them into the form of an optimization program involving maximization of a convex function on a compact set. The dimension of the search space is decreased enormously if the data matrix has many more columns (variables) than rows. We then propose and analyze a simple gradient method suited for the task. It appears that our algorithm has best convergence properties in the case when either the objective function or the feasible set are strongly convex, which is the case with our single-unit formulations and can be enforced in the block case. Finally, we demonstrate numerically on a set of random and gene expression test problems that our approach outperforms existing algorithms both in quality of the obtained solution and in computational speed.
Recommendations
- Sparse principal component analysis by choice of norm
- An exact approach to sparse principal component analysis
- Projection sparse principal component analysis: an efficient least squares method
- Sparse PCA: convex relaxations, algorithms and applications
- An augmented Lagrangian approach for sparse principal component analysis
Cited in
(only showing first 100 items - show all)- Sparse principal component analysis via variable projection
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios
- Principal minimax support vector machine for sufficient dimension reduction with contaminated data
- Regularized generalized canonical correlation analysis: a framework for sequential multiblock component methods
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
- Bayesian variable selection for globally sparse probabilistic PCA
- Monotonically convergent algorithms for symmetric tensor approximation
- Sparse principal component analysis by choice of norm
- On conjugate families and Jeffreys priors for von Mises-Fisher distributions
- Sparse total least squares: analysis and greedy algorithms
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Sparse power factorization: balancing peakiness and sample complexity
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- A guide for sparse PCA: model comparison and applications
- Global convergence of Riemannian line search methods with a Zhang-Hager-type condition
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- An active-set algorithm for norm constrained quadratic problems
- On the rotational invariant \(L_1\)-norm PCA
- An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking
- Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- From simple structure to sparse components: a review
- Projection sparse principal component analysis: an efficient least squares method
- Certifiably optimal sparse principal component analysis
- Sparse principal component analysis with missing observations
- On cutting planes for cardinality-constrained linear programs
- Semi-sparse PCA
- Robust sparse principal component analysis
- Sparsistency and agnostic inference in sparse PCA
- Sparse exponential family principal component analysis
- Minimax sparse principal subspace estimation in high dimensions
- Sparse PCA: optimal rates and adaptive estimation
- Estimation of low-rank matrices via approximate message passing
- Nonmonotone inexact restoration approach for minimization with orthogonality constraints
- Implicit steepest descent algorithm for optimization with orthogonality constraints
- Sparse PCA on fixed-rank matrices
- Robust sparse principal component analysis: situation of full sparseness
- Riemannian preconditioning
- Sparse PCA: convex relaxations, algorithms and applications
- Least squares sparse principal component analysis: a backward elimination approach to attain large loadings
- Nonconvex phase synchronization
- The sparse principal component analysis problem: optimality conditions and algorithms
- Optimal solutions for sparse principal component analysis
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Sparse principal component analysis subject to prespecified cardinality of loadings
- Maximization of Matrix Trace Function of Product Stiefel Manifolds
- Optimal detection of sparse principal components in high dimension
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Sparse PCA by iterative elimination algorithm
- Alternating direction method of multipliers for sparse principal component analysis
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- Near-optimal bounds for phase synchronization
- The restricted isometry property for random block diagonal matrices
- ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions
- Approximation bounds for sparse principal component analysis
- Semi‐supervised Eigenbasis novelty detection
- Understanding large text corpora via sparse machine learning
- scientific article; zbMATH DE number 7338724 (Why is no real title available?)
- scientific article; zbMATH DE number 7370563 (Why is no real title available?)
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
- Smart Alpha: active management with unstable and latent factors
- Identifiability of complete dictionary learning
- SIMPCA: a framework for rotating and sparsifying principal components
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Cutting plane generation through sparse principal component analysis
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- Fast deflation sparse principal component analysis via subspace projections
- Complete dictionary learning via ^4-norm maximization over the orthogonal group
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Sparse principal component analysis in Hilbert space
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Principal Component Analysis by Optimization of Symmetric Functions has no Spurious Local Optima
- Orthogonal connectivity factorization: interpretable decomposition of variability in correlation matrices
- Proximal distance algorithms: theory and practice
- Truncated power method for sparse eigenvalue problems
- Towards statistically provable geometric 3D human pose recovery
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Solving sparse principal component analysis with global support
- A general null space property for sparse principal component analysis
- Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold
- \(\mathrm{C_{enet}Biplot}\): a new proposal of sparse and orthogonal biplots methods by means of elastic net CSVD
- Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
- A unified approach to synchronization problems over subgroups of the orthogonal group
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- Provable sample-efficient sparse phase retrieval initialized by truncated power method
- PCA Sparsified
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- An exact approach to sparse principal component analysis
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Sparse multivariate functional principal component analysis
- Exactly Uncorrelated Sparse Principal Component Analysis
- An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem
- Fundamental limits of low-rank matrix estimation with diverging aspect ratios
- Sparse and integrative principal component analysis for multiview data
- Comment: Ridge Regression and Regularization of Large Matrices
- Sparse Principal Component Analysis Based on Least Trimmed Squares
- Sparse space-time resolvent analysis for statistically stationary and time-varying flows
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
This page was built for publication: Generalized power method for sparse principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896039)
