v1v2v3 (latest)

Computational Lower Bounds for Community Detection on Random Graphs

Annual Conference Computational Learning Theory (COLT), 2014

25 June 2014

Bruce Hajek

Yihong Wu

Jiaming Xu

ArXiv (abs)PDF HTML

Papers citing "Computational Lower Bounds for Community Detection on Random Graphs"

50 / 61 papers shown

Title
Robust Detection of Planted Subgraphs in Semi-Random Models Dor Elimelech Wasim Huleihel AAML 48 0 0 04 Aug 2025
Statistical inference of a ranked community in a directed graphSymposium on the Theory of Computing (STOC), 2024 Dmitriy Kunisky Daniel A. Spielman Alexander S. Wein Xifan Yu 163 1 0 18 Nov 2024
Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph Xifan Yu Ilias Zadik Peiyuan Zhang 131 3 0 26 Mar 2024
Information-Theoretic Thresholds for Planted Dense Cycles Cheng Mao Alexander S. Wein Shenduo Zhang 213 5 0 01 Feb 2024
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding Tong Qi V. Lyzinski 156 1 0 18 Dec 2023
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted CliqueAnnual Conference Computational Learning Theory (COLT), 2023 Guy Bresler Tianze Jiang 195 5 0 30 Jun 2023
Detection and Recovery of Hidden SubmatricesIEEE Transactions on Signal and Information Processing over Networks (TSIPN), 2023 M. Dadon Wasim Huleihel Tamir Bendory 251 5 0 11 Jun 2023
Bayes optimal learning in high-dimensional linear regression with network side informationIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2023 Sagnik Nandy Subhabrata Sen 246 2 0 09 Jun 2023
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra TrianglesIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 Guy Bresler Chenghao Guo Yury Polyanskiy 166 2 0 17 May 2023
Detection of Dense Subhypergraphs by Low-Degree Polynomials A. Dhawan Cheng Mao Alexander S. Wein 152 13 0 17 Apr 2023
Localized geometry detection in scale-free random graphs G. Bet Riccardo Michielan C. Stegehuis 120 0 0 06 Mar 2023
Detection-Recovery Gap for Planted Dense CyclesAnnual Conference Computational Learning Theory (COLT), 2023 Cheng Mao Alexander S. Wein Sheng Z. Zhang 261 12 0 13 Feb 2023
Planted Bipartite Graph DetectionIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2023 Asaf Rotenberg Wasim Huleihel O. Shayevitz 152 1 0 07 Feb 2023
Is it easier to count communities than find them?Information Technology Convergence and Services (ITCS), 2022 Cynthia Rush Fiona Skerman Alexander S. Wein Dana Yang 195 11 0 21 Dec 2022
Average-Case Complexity of Tensor Decomposition for Low-Degree PolynomialsSymposium on the Theory of Computing (STOC), 2022 Alexander S. Wein 241 13 0 10 Nov 2022
Community Recovery in the Geometric Block ModelJournal of machine learning research (JMLR), 2022 Sainyam Galhotra A. Mazumdar S. Pal B. Saha 219 8 0 22 Jun 2022
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional StatisticsNeural Information Processing Systems (NeurIPS), 2022 Afonso S. Bandeira A. Alaoui Samuel B. Hopkins T. Schramm Alexander S. Wein Ilias Zadik 196 39 0 19 May 2022
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine LearningJournal of Artificial Intelligence Research (JAIR), 2022 Itay Levinas Y. Louzoun 101 2 0 05 Jan 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 198 40 0 07 Dec 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 193 8 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 394 7 0 02 Oct 2021
Logspace Reducibility From Secret Leakage Planted Clique Jay Mardia 168 0 0 25 Jul 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost EquivalentAnnual Conference Computational Learning Theory (COLT), 2020 Matthew Brennan Guy Bresler Samuel B. Hopkins Haibin Zhang T. Schramm 358 66 0 13 Sep 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique DetectionAnnual Conference Computational Learning Theory (COLT), 2020 Yuetian Luo Anru R. Zhang 113 15 0 12 Sep 2020
Is the space complexity of planted clique recovery the same as that of detection?Information Technology Convergence and Services (ITCS), 2020 Jay Mardia 152 2 0 28 Aug 2020
Computational Barriers to Estimation from Low-Degree Polynomials T. Schramm Alexander S. Wein 249 75 0 05 Aug 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 454 52 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 294 99 0 16 May 2020
Phase Transitions for Detecting Latent Geometry in Random GraphsProbability theory and related fields (PTRF), 2019 Matthew Brennan Guy Bresler Dheeraj M. Nagaraj 226 37 0 30 Oct 2019
Detecting a planted community in an inhomogeneous random graph K. Bogerd Rui M. Castro R. Hofstad Nicolas Verzélen 68 3 0 07 Sep 2019
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Matthew Brennan Guy Bresler 293 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 208 161 0 26 Jul 2019
More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised LearningNeural Information Processing Systems (NeurIPS), 2019 Xinyang Yi Zhaoran Wang Zhuoran Yang Constantine Caramanis Han Liu 182 6 0 14 Jul 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 146 54 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 223 28 0 19 Feb 2019
Recovering a Single Community with Side Information H. Saad Aria Nosratinia 163 13 0 05 Sep 2018
Curse of Heterogeneity: Computational Barriers in Sparse Mixture Models and Phase Retrieval Jianqing Fan Han Liu Zhaoran Wang Zhuoran Yang 189 22 0 21 Aug 2018
Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure Matthew Brennan Guy Bresler Wasim Huleihel 259 117 0 19 Jun 2018
Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits Yihong Wu Jiaming Xu 250 41 0 31 May 2018
Connectivity in Random Annulus Graphs and the Geometric Block Model Sainyam Galhotra A. Mazumdar S. Pal B. Saha 221 11 0 12 Apr 2018
Notes on computational-to-statistical gaps: predictions using statistical physics Afonso S. Bandeira Amelia Perry Alexander S. Wein AI4CE 225 61 0 29 Mar 2018
Optimal link prediction with matrix logistic regression Nicolai Baldin Quentin Berthet 152 17 0 19 Mar 2018
Statistical and Computational Limits for Sparse Matrix Detection T. Tony Cai Yihong Wu 146 19 0 01 Jan 2018
The Geometric Block Model Sainyam Galhotra A. Mazumdar S. Pal B. Saha 189 30 0 16 Sep 2017
Query Complexity of Clustering with Side Information A. Mazumdar B. Saha 177 49 0 23 Jun 2017
Inference in Sparse Graphs with Pairwise Measurements and Side Information Dylan J. Foster Daniel Reichman Karthik Sridharan 249 7 0 08 Mar 2017
Tensor SVD: Statistical and Computational Limits Anru R. Zhang Dong Xia 319 190 0 08 Mar 2017
The use of deep learning in image segmentation, classification and detection Mihai-Sorin Badea Iulian-Ionut Felea L. Florea C. Vertan 181 43 0 31 May 2016
Semidefinite Programs for Exact Recovery of a Hidden Community Bruce Hajek Yihong Wu Jiaming Xu 283 33 0 20 Feb 2016
Sharp Computational-Statistical Phase Transitions via Oracle Computational Model Zhaoran Wang Quanquan Gu Han Liu 205 12 0 30 Dec 2015