Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

23 February 2015

Papers citing "Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems"

21 / 21 papers shown

Title
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization Ryan Cory-Wright J. Pauphilet 96 0 0 06 Jan 2025
Concentration of polynomial random matrices via Efron-Stein inequalities Goutham Rajendran Madhur Tulsiani 115 8 0 06 Sep 2022
Robust Estimation for Random Graphs Jayadev Acharya Ayush Jain Gautam Kamath A. Suresh Huanyu Zhang 143 9 0 09 Nov 2021
Distribution free optimality intervals for clustering M. Meilă Hanyu Zhang OOD 77 0 0 30 Jul 2021
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 105 24 0 02 Mar 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Haibin Zhang T. Schramm 122 66 0 13 Sep 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection Yuetian Luo Anru R. Zhang 65 15 0 12 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 178 49 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 133 95 0 16 May 2020
The Overlap Gap Property in Principal Submatrix Recovery D. Gamarnik Aukosh Jagannath S. Sen 89 29 0 26 Aug 2019
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Matthew Brennan Guy Bresler 145 12 0 08 Aug 2019
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 132 151 0 26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 274 63 0 26 Jul 2019
Computational Hardness of Certifying Bounds on Constrained PCA Problems Afonso S. Bandeira Dmitriy Kunisky Alexander S. Wein 94 69 0 19 Feb 2019
High-dimensional estimation via sum-of-squares proofs P. Raghavendra T. Schramm David Steurer 131 60 0 30 Jul 2018
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure Matthew Brennan Guy Bresler Wasim Huleihel 187 114 0 19 Jun 2018
Bayesian estimation from few samples: community detection and related problems Samuel B. Hopkins David Steurer 140 62 0 30 Sep 2017
Structured signal recovery from quadratic measurements: Breaking sample complexity barriers via nonconvex optimization Mahdi Soltanolkotabi 107 106 0 20 Feb 2017
Semidefinite Programs for Exact Recovery of a Hidden Community Bruce Hajek Yihong Wu Jiaming Xu 170 32 0 20 Feb 2016
$Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(\|E\| \log^\|V\|)$ Time$ Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in $O(\|E\| \log^\|V\|)$ Time Bruce Hajek Yihong Wu Jiaming Xu 101 22 0 09 Oct 2015
Sum-of-Squares Lower Bounds for Sparse PCA Tengyu Ma A. Wigderson 124 74 0 23 Jul 2015