DeepAI AI Chat
Log In Sign Up

A Randomized Rounding Algorithm for Sparse PCA

by   Kimon Fountoulakis, et al.
Rensselaer Polytechnic Institute
berkeley college

We present and analyze a simple, two-step algorithm to approximate the optimal solution of the sparse PCA problem. Our approach first solves a L1 penalized version of the NP-hard sparse PCA optimization problem and then uses a randomized rounding strategy to sparsify the resulting dense solution. Our main theoretical result guarantees an additive error approximation and provides a tradeoff between sparsity and accuracy. Our experimental evaluation indicates that our approach is competitive in practice, even compared to state-of-the-art toolboxes such as Spasm.


Sparse PCA on fixed-rank matrices

Sparse PCA is the optimization problem obtained from PCA by adding a spa...

CUR from a Sparse Optimization Viewpoint

The CUR decomposition provides an approximation of a matrix X that has l...

NP-Hardness and Inapproximability of Sparse PCA

We give a reduction from clique to establish that sparse PCA is NP-hard...

L1-norm Kernel PCA

We present the first model and algorithm for L1-norm kernel PCA. While L...

Sparse PCA: a Geometric Approach

We consider the problem of maximizing the variance explained from a data...

Approximating Sparse PCA from Incomplete Data

We study how well one can recover sparse principal components of a data ...

Sparse PCA through Low-rank Approximations

We introduce a novel algorithm that computes the k-sparse principal comp...