Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure

19 June 2018

Papers citing "Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure"

28 / 28 papers shown

Title
Low degree conjecture implies sharp computational thresholds in stochastic block model Jingqiu Ding Yiding Hua Lucas Slot David Steurer 77 1 0 20 Feb 2025
On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance Jean Barbier Francesco Camilli Justin Ko Koki Okajima 37 5 0 04 Nov 2024
Computational lower bounds for multi-frequency group synchronization Anastasia Kireeva Afonso S. Bandeira Dmitriy Kunisky 51 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 32 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 40 1 0 25 Jul 2023
Statistical and computational rates in high rank tensor estimation Chanwoo Lee Miaoyan Wang 33 1 0 08 Apr 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
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials Alexander S. Wein 27 9 0 10 Nov 2022
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning Itay Levinas Y. Louzoun 24 1 0 05 Jan 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 17 35 0 07 Dec 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 19 7 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 25 6 0 02 Oct 2021
On Support Recovery with Sparse CCA: Information Theoretic and Computational Limits Nilanjana Laha Rajarshi Mukherjee 31 4 0 14 Aug 2021
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 21 21 0 02 Mar 2021
A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix C. Watanabe Taiji Suzuki 25 0 0 23 Feb 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
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection Yuetian Luo Anru R. Zhang 30 14 0 12 Sep 2020
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 35 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 31 86 0 16 May 2020
The estimation error of general first order methods Michael Celentano Andrea Montanari Yuchen Wu 16 44 0 28 Feb 2020
Balancing Gaussian vectors in high dimension Paxton Turner Raghu Meka Philippe Rigollet 31 25 0 30 Oct 2019
Estimation of Wasserstein distances in the Spiked Transport Model Jonathan Niles-Weed Philippe Rigollet 25 102 0 16 Sep 2019
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
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 29 50 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 35 26 0 19 Feb 2019
High-Temperature Structure Detection in Ferromagnets Yuan Cao Matey Neykov Han Liu 24 10 0 21 Sep 2018