Learning Feature Sparse Principal Components

2019-04-23 · Lai Tian, Feiping Nie, Xuelong. Li

This paper presents new algorithms to solve the feature-sparsity constrained PCA problem (FSPCA), which performs feature selection and PCA simultaneously. Existing optimization methods for FSPCA require data distribution assumptions and are lack of global convergence guarantee. Though the general FSPCA problem is NP-hard, we show that, for a low-rank covariance, FSPCA can be solved globally (Algorithm 1). Then, we propose another strategy (Algorithm 2) to solve FSPCA for the general covariance by iteratively building a carefully designed proxy. We prove theoretical guarantees on approximation and convergence for the new algorithms. Experimental results show the promising performance of the new algorithms compared with the state-of-the-arts on both synthetic and real-world datasets.

📄 PDF Abstract BibTeX arXiv:1904.10155

Code (0)

등록된 구현이 없습니다.

Tasks

feature selection

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…

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…

Sparse PCA on fixed-rank matrices

2022-01-07 · Alberto Del Pia

Sparse PCA is the optimization problem obtained from PCA by adding a sparsity constraint on the principal components. Sparse PCA is NP-hard and hard to approximate even in the single-component case. In this paper we sett…

Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality

2020-05-11 · Dimitris Bertsimas, Ryan Cory-Wright, Jean Pauphilet

Sparse principal component analysis (PCA) is a popular dimensionality reduction technique for obtaining principal components which are linear combinations of a small subset of the original features. Existing approaches c…

Dimensionality Reduction

Principal component-guided sparse regression

2018-10-10 · J. Kenneth Tay, Jerome Friedman, Robert Tibshirani

We propose a new method for supervised learning, especially suited to wide data where the number of features is much greater than the number of observations. The method combines the lasso ($\ell_1$) sparsity penalty with…

regression

Sparse principal component regression with adaptive loading

2014-02-26 · Shuichi. Kawano, Hironori Fujisawa, Toyoyuki Takada, Toshihiko Shiroishi

Principal component regression (PCR) is a two-stage procedure that selects some principal components and then constructs a regression model regarding them as new explanatory variables. Note that the principal components …