Universality of Computational Lower Bounds for Submatrix Detection

19 February 2019

Papers citing "Universality of Computational Lower Bounds for Submatrix Detection"

8 / 8 papers shown

Title
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
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
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
Convex optimization for the densest subgraph and densest submatrix problems Polina Bombina Brendan P. W. Ames 32 9 0 05 Apr 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 29 50 0 20 Feb 2019