Sparse PCA with False Discovery Rate Controlled Variable Selection

Jasin Machkour, Arnaud Breloy, Michael Muma, Daniel P. Palomar, Frédéric Pascal
1/16/2024
stat.MLcs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Sparse principal component analysis (PCA) aims at mapping large dimensional data to a linear subspace of lower dimension. By imposing loading vectors to be sparse, it performs the double duty of dimension reduction and variable selection. Sparse PCA algorithms are usually expressed as a trade-off between explained variance and sparsity of the loading vectors (i.e., number of selected variables). As a high explained variance is not necessarily synonymous with relevant information, these methods are prone to select irrelevant variables. To overcome this issue, we propose an alternative formulation of sparse PCA driven by the false discovery rate (FDR). We then leverage the Terminating-Random Experiments (T-Rex) selector to automatically determine an FDR-controlled support of the loading vectors. A major advantage of the resulting T-Rex PCA is that no sparsity parameter tuning is required. Numerical experiments and a stock market data example demonstrate a significant performance improvement.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{machkour2024sparse,
  title  = {Sparse PCA with False Discovery Rate Controlled Variable Selection},
  author = {Jasin Machkour and Arnaud Breloy and Michael Muma and Daniel P. Palomar and Frédéric Pascal},
  year   = {2024},
  eprint = {2401.08375},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.08375v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.08375.svg)](https://codeofpaper.com/paper/2401.08375)

Discussion