v1v2 (latest)

How Robust are Reconstruction Thresholds for Community Detection?

4 November 2015

Papers citing "How Robust are Reconstruction Thresholds for Community Detection?"

45 / 45 papers shown

Title
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering Vincent Cohen-Addad Tommaso dÓrsi Aida Mousavifar 98 1 0 07 Jun 2024
Adversarially-Robust Inference on Trees via Belief Propagation Samuel B. Hopkins Anqi Li 69 0 0 31 Mar 2024
Top- $K$ ranking with a monotone adversary Yuepeng Yang Antares Chen Lorenzo Orecchia Cong Ma 90 1 0 12 Feb 2024
Local Geometry Determines Global Landscape in Low-rank Factorization for Synchronization Shuyang Ling 49 6 0 30 Nov 2023
A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time Ranran Shen Pan Peng 65 0 0 27 Oct 2023
Do algorithms and barriers for sparse principal component analysis extend to other structured settings? Guanyi Wang Mengqi Lou A. Pananjady CML 96 1 0 25 Jul 2023
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions Jingqiu Ding Tommaso dÓrsi Yiding Hua David Steurer 75 6 0 17 May 2023
Spectral clustering in the Gaussian mixture block model Shuangping Li T. Schramm 90 8 0 29 Apr 2023
Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees Jacob Imola Alessandro Epasto Mohammad Mahdian Vincent Cohen-Addad Vahab Mirrokni 109 4 0 31 Jan 2023
Private estimation algorithms for stochastic block models and mixture models Hongjie Chen Vincent Cohen-Addad Tommaso dÓrsi Alessandro Epasto Jacob Imola David Steurer Stefan Tiegel FedML 103 21 0 11 Jan 2023
Minimax Rates for Robust Community Detection Allen Liu Ankur Moitra 64 14 0 25 Jul 2022
Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold Jun Sheng Thomas Strohmer 70 0 0 24 May 2022
Testing distributional assumptions of learning algorithms R. Rubinfeld Arsen Vasilyan OOD 50 19 0 14 Apr 2022
Semi-Random Sparse Recovery in Nearly-Linear Time Jonathan A. Kelner Jungshian Li Allen Liu Aaron Sidford Kevin Tian 64 15 0 08 Mar 2022
Robust recovery for stochastic block models Jingqiu Ding Tommaso dÓrsi Rajai Nasser David Steurer 55 20 0 16 Nov 2021
Robust Estimation for Random Graphs Jayadev Acharya Ayush Jain Gautam Kamath A. Suresh Huanyu Zhang 93 9 0 09 Nov 2021
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models Flavio Chierichetti A. Panconesi Giuseppe Re Luca Trevisan AAML 57 2 0 10 Aug 2021
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates Tommaso dÓrsi Pravesh Kothari Gleb Novikov David Steurer AAML 133 25 0 12 Nov 2020
Near-Optimal Comparison Based Clustering Michaël Perrot Pascal Esser Debarghya Ghoshdastidar 43 12 0 08 Oct 2020
Fast and Near-Optimal Diagonal Preconditioning A. Jambulapati Jingkai Li Christopher Musco Aaron Sidford Kevin Tian 23 7 0 04 Aug 2020
Estimating Principal Components under Adversarial Perturbations Pranjal Awasthi Xue Chen Aravindan Vijayaraghavan AAML 62 2 0 31 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 99 91 0 16 May 2020
Consistency of Spectral Clustering on Hierarchical Stochastic Block Models Lihua Lei Xiaodong Li Xingmei Lou 46 19 0 30 Apr 2020
Improper Learning for Non-Stochastic Control Max Simchowitz Karan Singh Elad Hazan 99 159 0 25 Jan 2020
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Matthew Brennan Guy Bresler 133 12 0 08 Aug 2019
Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly Yingjie Fei Yudong Chen 273 24 0 21 Apr 2019
Convex Relaxation Methods for Community Detection Xiaodong Li Yudong Chen Jiaming Xu 131 51 0 30 Sep 2018
Partial recovery bounds for clustering with the relaxed $K$ means Christophe Giraud Nicolas Verzélen 268 60 0 19 Jul 2018
Towards Learning Sparsely Used Dictionaries with Arbitrary Supports Pranjal Awasthi Aravindan Vijayaraghavan 49 7 0 23 Apr 2018
Non-Convex Matrix Completion Against a Semi-Random Adversary Yu Cheng Rong Ge AAML 61 25 0 28 Mar 2018
Hidden Integrality and Semi-random Robustness of SDP Relaxation for Sub-Gaussian Mixture Model Yingjie Fei Yudong Chen 56 4 0 17 Mar 2018
Clustering Semi-Random Mixtures of Gaussians Pranjal Awasthi Aravindan Vijayaraghavan 40 11 0 23 Nov 2017
Minimax Rates and Efficient Algorithms for Noisy Sorting Cheng Mao Jonathan Niles-Weed Philippe Rigollet 313 42 0 28 Oct 2017
Projected Power Iteration for Network Alignment Efe Onaran Soledad Villar 59 9 0 16 Jul 2017
Exponential error rates of SDP for block models: Beyond Grothendieck's inequality Yingjie Fei Yudong Chen 320 35 0 23 May 2017
Does robustness imply tractability? A lower bound for planted clique in the semi-random model Jacob Steinhardt 58 17 0 17 Apr 2017
Community Detection and Stochastic Block Models Emmanuel Abbe 188 1,200 0 29 Mar 2017
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality Song Mei Theodor Misiakiewicz Andrea Montanari R. Oliveira 80 73 0 25 Mar 2017
Exact recovery in the Ising blockmodel Quentin Berthet Philippe Rigollet P. Srivastava TPM 117 45 0 12 Dec 2016
Learning from Untrusted Data Moses Charikar Jacob Steinhardt Gregory Valiant FedML OOD 134 300 0 07 Nov 2016
How Well Do Local Algorithms Solve Semidefinite Programs? Z. Fan Andrea Montanari 82 20 0 17 Oct 2016
Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction Jacob Steinhardt Gregory Valiant Moses Charikar 73 35 0 16 Jun 2016
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap Emmanuel Abbe Colin Sandon 183 120 0 30 Dec 2015
Learning Communities in the Presence of Errors K. Makarychev Yury Makarychev Aravindan Vijayaraghavan 194 33 0 10 Nov 2015
A semidefinite program for unbalanced multisection in the stochastic block model William Perry Alexander S. Wein 210 50 0 20 Jul 2015