Multi-Rank Sparse and Functional PCA: Manifold Optimization and Iterative Deflation Techniques

Abstract

We consider the problem of estimating multiple principal components using the recently-proposed Sparse and Functional Principal Components Analysis (SFPCA) estimator. We first propose an extension of SFPCA which estimates several principal components simultaneously using manifold optimization techniques to enforce orthogonality constraints. While effective, this approach is computationally burdensome so we also consider iterative deflation approaches which take advantage of existing fast algorithms for rank-one SFPCA. We show that alternative deflation schemes can more efficiently extract signal from the data, in turn improving estimation of subsequent components. Finally, we compare the performance of our manifold optimization and deflation techniques in a scenario where orthogonality does not hold and find that they still lead to significantly improved performance.

arXiv commentTo appear in IEEE CAMSAP 2019

References in corpus (8)

• A Conceptual Introduction to Hamiltonian Monte Carlo
• Generalized power method for sparse principal component analysis
• Functional principal components analysis via penalized rank one approximation
• Sparse Generalized Eigenvalue Problem via Smooth Optimization
• Orthogonal Sparse PCA and Covariance Estimation via Procrustes Reformulation
• Sparse and Functional Principal Components Analysis
• An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold

Cited by in corpus (2)

• An iterative coordinate descent algorithm to compute sparse low-rank approximations
• Sparse Partial Least Squares for Coarse Noisy Graph Alignment