An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA

2019/03/27 by Chen, Shixiang, Ma, Shiqian, Xue, Lingzhou +1 · 1 citation
#Computation (stat.CO) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1903.11576

Abstract

Sparse principal component analysis (PCA) and sparse canonical correlation analysis (CCA) are two essential techniques from high-dimensional statistics and machine learning for analyzing large-scale data. Both problems can be formulated as an optimization problem with nonsmooth objective and nonconvex constraints. Since non-smoothness and nonconvexity bring numerical difficulties, most algorithms suggested in the literature either solve some relaxations or are heuristic and lack convergence guarantees. In this paper, we propose a new alternating manifold proximal gradient method to solve these two high-dimensional problems and provide a unified convergence analysis. Numerical experiment results are reported to demonstrate the advantages of our algorithm.

Cited by

• A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria

Related

• An Extension of Fast Iterative Shrinkage-thresholding to Riemannian Optimization for Sparse Principal Component Analysis
• An Augmented Lagrangian Approach for Sparse Principal Component Analysis
• Manifold Quadratic Penalty Alternating Minimization for Sparse Principal Component Analysis
• Cellwise robust and sparse principal component analysis
• ℓ₁-norm constrained multi-block sparse canonical correlation analysis via proximal gradient descent