From explained variance of correlated components to PCA without orthogonality constraints

2024-02-07 · Marie Chavent, Guy Chavent

Block Principal Component Analysis (Block PCA) of a data matrix A, where loadings Z are determined by maximization of AZ 2 over unit norm orthogonal loadings, is difficult to use for the design of sparse PCA by 1 regularization, due to the difficulty of taking care of both the orthogonality constraint on loadings and the non differentiable 1 penalty. Our objective in this paper is to relax the orthogonality constraint on loadings by introducing new objective functions expvar(Y) which measure the part of the variance of the data matrix A explained by correlated components Y = AZ. So we propose first a comprehensive study of mathematical and numerical properties of expvar(Y) for two existing definitions Zou et al. [2006], Shen and Huang [2008] and four new definitions. Then we show that only two of these explained variance are fit to use as objective function in block PCA formulations for A rid of orthogonality constraints.

📄 PDF Abstract BibTeX arXiv:2402.04692

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

NON 설명 없음

Sparse PCA With Multiple Components

2022-09-29 · Ryan Cory-Wright, Jean Pauphilet

Sparse Principal Component Analysis (sPCA) is a cardinal technique for obtaining combinations of features, or principal components (PCs), that explain the variance of high-dimensional datasets in an interpretable manner.…

msPCA: An R Package for Sparse PCA with Multiple Components

2026-07-06 · Ryan Cory-Wright, Jean Pauphilet arxiv

We present msPCA: an open-source R package for sparse principal component analysis with multiple components. It implements an alternating maximization algorithm to generate a set of sparse loading vectors that collective…

Optimal Projected Variance Group-Sparse Block PCA

2017-05-01 · Marie Chavent, Guy Chavent

We address the problem of defining a group sparse formulation for Principal Components Analysis (PCA) - or its equivalent formulations as Low Rank approximation or Dictionary Learning problems - which achieves a compromi…

Dictionary Learning Retrieval

spca: An R package to Compute Least Squares Sparse Principal Components

2026-06-27 · Giovanni Maria Merola arxiv

This paper introduces the R package spca, which provides a computational framework for least squares sparse principal component analysis (LS-SPCA). Unlike other SPCA methods, LS-SPCA generates uncorrelated sparse princip…

Orthogonal Sparse PCA and Covariance Estimation via Procrustes Reformulation

2016-02-12 · Konstantinos Benidis, Ying Sun, Prabhu Babu, Daniel P. Palomar

The problem of estimating sparse eigenvectors of a symmetric matrix attracts a lot of attention in many applications, especially those with high dimensional data set. While classical eigenvectors can be obtained as the s…