Sparse GCA and Thresholded Gradient Descent
arXiv:2107.00371
Abstract
Generalized correlation analysis (GCA) is concerned with uncovering linear relationships across multiple datasets. It generalizes canonical correlation analysis that is designed for two datasets. We study sparse GCA when there are potentially multiple generalized correlation tuples in data and the loading matrix has a small number of nonzero rows. It includes sparse CCA and sparse PCA of correlation matrices as special cases. We first formulate sparse GCA as generalized eigenvalue problems at both population and sample levels via a careful choice of normalization constraints. Based on a Lagrangian form of the sample optimization problem, we propose a thresholded gradient descent algorithm for estimating GCA loading vectors and matrices in high dimensions. We derive tight estimation error bounds for estimators generated by the algorithm with proper initialization. We also demonstrate the prowess of the algorithm on a number of synthetic datasets.
References in corpus (11)
- Simultaneous analysis of Lasso and Dantzig selector
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Sparse principal component analysis and iterative thresholding
- Sparse PCA: Optimal rates and adaptive estimation
- Truncated Power Method for Sparse Eigenvalue Problems
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
- Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
- Computational Lower Bounds for Sparse PCA
- Sparse CCA via Precision Adjusted Iterative Thresholding
- Generalized Canonical Correlation Analysis for Classification
- Estimating Number of Factors by Adjusted Eigenvalues Thresholding