Sparse PCA Beyond Covariance Thresholding

In the Wishart model for sparse PCA we are given n samples Y1,ldots, Yn drawn independently from a d-dimensional Gaussian distribution N(0, Id + β vv^top), where β > 0 and v∈ ℝd is a k-sparse unit vector, and we wish to recover v (up to sign). We show that if n ≥ Omega(d), then for every t ll k there exists an algorithm running in time n· dO(t) that solves this problem as long as [ β gtrsim frack√nt√ln(2 + td/k2),. ] Prior to this work, the best polynomial time algorithm in the regime k≈ √d, called Covariance Thresholding (proposed in [KNV15a] and analyzed in [DM14]), required β gtrsim frack√n√ln(2 + d/k2). For large enough constant t our algorithm runs in polynomial time and has better guarantees than Covariance Thresholding. Previously known algorithms with such guarantees required quasi-polynomial time dO(log d). In addition, we show that our techniques work with sparse PCA with adversarial perturbations studied in [dKNS20]. This model generalizes not only sparse PCA, but also other problems studied in prior works, including the sparse planted vector problem. As a consequence, we provide polynomial time algorithms for the sparse planted vector problem that have better guarantees than the state of the art in some regimes. Our approach also works with the Wigner model for sparse PCA. Moreover, we show that it is possible to combine our techniques with recent results on sparse PCA with symmetric heavy-tailed noise [dNNS22]. In particular, in the regime k ≈ √d we get the first polynomial time algorithm that works with symmetric heavy-tailed noise, while the algorithm from [dNNS22]. requires quasi-polynomial time in these settings.