Sparse Principal Component Analysis with Non-Oblivious Adversarial Perturbations
Yuqing He, Guanyi Wang, Yu Yang

TL;DR
This paper develops a robust sparse PCA method resilient to non-oblivious adversarial perturbations, providing theoretical guarantees and practical algorithms for high-dimensional data analysis.
Contribution
It introduces a new formulation for sparse PCA under non-oblivious adversarial perturbations and derives MIP-based bounds with provable guarantees.
Findings
MIP reformulations upper bound the robust sparse PCA problem.
The method guarantees vector recovery under the spiked Wishart model.
Numerical results validate the theoretical robustness and accuracy.
Abstract
Sparse Principal Component Analysis (sparse PCA) is a fundamental dimension-reduction tool that enhances interpretability in various high-dimensional settings. An important variant of sparse PCA studies the scenario when samples are adversarially perturbed. Notably, most existing statistical studies on this variant focus on recovering the ground truth and verifying the robustness of classical algorithms when the given samples are corrupted under oblivious adversarial perturbations. In contrast, this paper aims to find a robust sparse principal component that maximizes the variance of the given samples corrupted by non-oblivious adversarial perturbations, say sparse PCA with Non-Oblivious Adversarial Perturbations (sparse PCA-NOAP). Specifically, we introduce a general formulation for the proposed sparse PCA-NOAP. We then derive Mixed-Integer Programming (MIP) reformulations to upper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Spectroscopy Techniques in Biomedical and Chemical Research · Image Processing Techniques and Applications
