Subexponential-Time Algorithms for Sparse PCA

Subexponential-Time Algorithms for Sparse PCA

26 July 2019

Dmitriy Kunisky

Alexander S. Wein

Afonso S. Bandeira

Papers citing "Subexponential-Time Algorithms for Sparse PCA"

13 / 13 papers shown

Title
Computational lower bounds for multi-frequency group synchronization Anastasia Kireeva Afonso S. Bandeira Dmitriy Kunisky 48 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 24 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 38 1 0 25 Jul 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 21 4 0 26 Jan 2023
Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation Andrea Montanari Alexander S. Wein 13 25 0 14 Dec 2022
Learning and Testing Latent-Tree Ising Models Efficiently Davin Choo Y. Dagan C. Daskalakis Anthimos Vardis Kandiros 22 8 0 23 Nov 2022
Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model Zhongyuan Lyu Dong Xia 29 3 0 11 Jul 2022
Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay Yuetian Luo Anru R. Zhang 29 19 0 17 Jun 2022
Reconstruction on Trees and Low-Degree Polynomials Frederic Koehler Elchanan Mossel 32 9 0 14 Sep 2021
On Support Recovery with Sparse CCA: Information Theoretic and Computational Limits Nilanjana Laha Rajarshi Mukherjee 31 4 0 14 Aug 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins J. Li T. Schramm 19 62 0 13 Sep 2020
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 33 14 0 21 May 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 35 44 0 21 May 2020