Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles

17 May 2023

Papers citing "Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles"

9 / 9 papers shown

Title
Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation Andrea Montanari Alexander S. Wein 33 25 0 14 Dec 2022
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials Alexander S. Wein 54 9 0 10 Nov 2022
Cryptographic Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane Pasin Manurangsi Lisheng Ren 51 24 0 28 Jul 2022
From Local Pseudorandom Generators to Hardness of Learning Amit Daniely Gal Vardi 111 30 0 20 Jan 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Jingkai Li T. Schramm 51 64 0 13 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 80 45 0 21 May 2020
The estimation error of general first order methods Michael Celentano Andrea Montanari Yuchen Wu 43 45 0 28 Feb 2020
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 62 27 0 19 Feb 2019
Limits of local algorithms over sparse random graphs D. Gamarnik Madhu Sudan 59 163 0 05 Apr 2013