Subexponential-Time Algorithms for Sparse PCA

26 July 2019

Papers citing "Subexponential-Time Algorithms for Sparse PCA"

7 / 7 papers shown

Title
Computational lower bounds for multi-frequency group synchronization Anastasia Kireeva Afonso S. Bandeira Dmitriy Kunisky 31 1 0 05 Jun 2024
Low-degree phase transitions for detecting a planted clique in sublinear time Jay Mardia K. A. Verchand Alexander S. Wein 10 1 0 08 Feb 2024
Do algorithms and barriers for sparse principal component analysis extend to other structured settings? Guanyi Wang Mengqi Lou A. Pananjady CML 20 1 0 25 Jul 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 14 4 0 26 Jan 2023
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay Yuetian Luo Anru R. Zhang 10 19 0 17 Jun 2022
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins J. Li T. Schramm 6 62 0 13 Sep 2020
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 16 14 0 21 May 2020