mlsanityData to 14 Oct 2026

Sparse PCA with False Discovery Rate Controlled Variable Selection

arXiv 2401.08375 ↗First posted 16 Jan 2024stat.ML cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 16 Jan 2024.

Builds on

5 of 24 references.

References · 5

  1. 2016Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selectioncited by 121
  2. 2014Controlling the false discovery rate via knockoffscited by 97
  3. 2021The Terminating-Random Experiments Selector: Fast High-Dimensional Variable Selection with False Discovery Rate Controlcited by 10
  4. 2016Orthogonal Sparse PCA and Covariance Estimation via Procrustes Reformulationcited by 5
  5. 2014Sparse Principal Component Analysis via Rotation and Truncationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.