The Complexity of Sparse Tensor PCA

We study the problem of sparse tensor principal component analysis: given a tensor pmb Y = pmb W + λ xotimes p with pmb W ∈ otimespℝn having i.i.d. Gaussian entries, the goal is to recover the k-sparse unit vector x ∈ ℝn. The model captures both sparse PCA (in its Wigner form) and tensor PCA. For the highly sparse regime of k ≤ √n, we present a family of algorithms that smoothly interpolates between a simple polynomial-time algorithm and the exponential-time exhaustive search algorithm. For any 1 ≤ t ≤ k, our algorithms recovers the sparse vector for signal-to-noise ratio λ ≥ tildeO (√t · (k/t)p/2) in time tildeO(np+t), capturing the state-of-the-art guarantees for the matrix settings (in both the polynomial-time and sub-exponential time regimes). Our results naturally extend to the case of r distinct k-sparse signals with disjoint supports, with guarantees that are independent of the number of spikes. Even in the restricted case of sparse PCA, known algorithms only recover the sparse vectors for λ ≥ tildeO(k · r) while our algorithms require λ ≥ tildeO(k). Finally, by analyzing the low-degree likelihood ratio, we complement these algorithmic results with rigorous evidence illustrating the trade-offs between signal-to-noise ratio and running time. This lower bound captures the known lower bounds for both sparse PCA and tensor PCA. In this general model, we observe a more intricate three-way trade-off between the number of samples n, the sparsity k, and the tensor power p.