Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness

20 February 2019

Papers citing "Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness"

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
Minimax rates in variance and covariance changepoint testing Per August Jarval Moen 45 0 0 13 May 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
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians Sami Davies A. Mazumdar S. Pal Cyrus Rashtchian 44 11 0 02 Sep 2021
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 21 21 0 02 Mar 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Jingkai 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
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 29 86 0 16 May 2020
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 29 136 0 26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 30 57 0 26 Jul 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 32 26 0 19 Feb 2019
High-Temperature Structure Detection in Ferromagnets Yuan Cao Matey Neykov Han Liu 24 10 0 21 Sep 2018