Sparse principal component analysis via variable projection
From MaRDI portal
Abstract: Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating between distinct time scales. We demonstrate a robust and scalable SPCA algorithm by formulating it as a value-function optimization problem. This viewpoint leads to a flexible and computationally efficient algorithm. Further, we can leverage randomized methods from linear algebra to extend the approach to the large-scale (big data) setting. Our proposed innovation also allows for a robust SPCA formulation which obtains meaningful sparse principal components in spite of grossly corrupted input data. The proposed algorithms are demonstrated using both synthetic and real world data, and show exceptional computational efficiency and diagnostic performance.
Recommendations
- Robust sparse principal component analysis
- Projection sparse principal component analysis: an efficient least squares method
- Sparse generalized principal component analysis for large-scale applications beyond Gaussianity
- Sparse principal component analysis via regularized low rank matrix approximation
- Sparse principal component analysis via fractional function regularity
Cites work
- scientific article; zbMATH DE number 2045498 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A hierarchy of low-dimensional models for the transient and post-transient cylinder wake
- A minimization principle for the description of modes associated with finite-time instabilities
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Adaptive \(h\)-refinement for reduced-order models
- Cluster-based reduced-order modelling of a mixing layer
- Compressed modes for variational problems in mathematics and physics
- Constrained sparse Galerkin regression
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Data-Driven Sparse Sensor Placement for Reconstruction: Demonstrating the Benefits of Exploiting Known Patterns
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- Dynamically orthogonal field equations for continuous stochastic dynamical systems
- Efficient Quadratic Penalization Through the Partial Minimization Technique
- Estimating nuisance parameters in inverse problems
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized power method for sparse principal component analysis
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- Improve robustness of sparse PCA by \(L_{1}\)-norm maximization
- Least angle regression. (With discussion)
- Linear dimensionality reduction: survey, insights, and generalizations
- Model Selection and Estimation in Regression with Grouped Variables
- Multiresolution dynamic mode decomposition
- Network structure of two-dimensional decaying isotropic turbulence
- Optimal solutions for sparse principal component analysis
- Procrustes Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal splitting methods in signal processing
- RandNLA
- Randomized Algorithms for Matrices and Data
- Regularization and Variable Selection Via the Elastic Net
- Robust Statistics
- Robust principal component analysis?
- Separable nonlinear least squares: the variable projection method and its applications
- Sparse PCA: optimal rates and adaptive estimation
- Sparse dynamics for partial differential equations
- Sparse principal component analysis via regularized low rank matrix approximation
- Sparsity and Smoothness Via the Fused Lasso
- The immersed boundary method: a projection approach
- Variable projection methods for an optimized dynamic mode decomposition
- Variational Analysis
- Why Are Big Data Matrices Approximately Low Rank?
Cited in
(24)- Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
- An empirical comparison of two approaches for CDPCA in high-dimensional data
- Robust sparse principal component analysis
- Numerical approximation of partial differential equations by a variable projection method with artificial neural networks
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- Solving sparse principal component analysis with global support
- Feature grouping and sparse principal component analysis with truncated regularization
- Multi-step-length gradient iterative method for separable nonlinear least squares problems.
- Sparse Independent Component Analysis with an Application to Cortical Surface fMRI Data in Autism
- Spike and slab Bayesian sparse principal component analysis
- Shallow neural networks for fluid flow reconstruction with limited sensors
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Sparse Principal Component Analysis via Axis-Aligned Random Projections
- sparsepca
- The sparse principal component analysis problem: optimality conditions and algorithms
- Sparse principal component regression via singular value decomposition approach
- Separable nonlinear least-squares parameter estimation for complex dynamic systems
- scientific article; zbMATH DE number 6129459 (Why is no real title available?)
- Sparse Variable PCA Using Geodesic Steepest Descent
- Sparse generalized principal component analysis for large-scale applications beyond Gaussianity
- A priori sparsification of Galerkin models
- Variable projection algorithms with sparse constraint for separable nonlinear models
- Sparse and integrative principal component analysis for multiview data
- Detecting changes in the second moment structure of high-dimensional sensor-type data in a \(K\)-sample setting
This page was built for publication: Sparse principal component analysis via variable projection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q150980)
