Fetching the paper…
Reading the bibliography…
In this work, we study the problem of community detection in the stochastic block model with adversarial node corruptions.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Heuristics for semirandom graph problems
Uriel Feige and Joe Kilian · 2001
Earlier work this paper cites.
A local search approximation algorithm for k-means clustering
Tapas Kanungo, David M Mount, Nathan S Netanyahu, Christine D Piatko, Ruth Silverman, and Angela Y Wu · 2004
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
Aurelien Decelle, Florent Krzakala, Cristopher Moore, and Lenka Zdeborová · 2011
Earlier work this paper cites.
Universality of wigner random matrices: a survey of recent results
Laszlo Erdos · 2011
Earlier work this paper cites.
Asymptotic power of sphericity tests for high-dimensional data
Alexei Onatski, Marcelo J Moreira, and Marc Hallin · 2013
Earlier work this paper cites.
Community detection in sparse networks via grothendieck’s inequality
Olivier Guédon and Roman Vershynin · 2014
Earlier work this paper cites.
Community detection thresholds and the weak ramanujan property
Laurent Massoulié · 2014
Earlier work this paper cites.
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Earlier work this paper cites.
Exact recovery in the stochastic block model
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall · 2015
Earlier work this paper cites.
Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery
Peter Chin, Anup Rao, and Van Vu · 2015
Earlier work this paper cites.
Asymptotic mutual information for the two-groups stochastic block model
Yash Deshpande, Emmanuel Abbe, and Andrea Montanari · 2015
Earlier work this paper cites.
Semidefinite programs on sparse random graphs
Andrea Montanari and Subhabrata Sen · 2015
Earlier work this paper cites.
Achieving exact cluster recovery threshold via semidefinite programming
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2016
Cited alongside, same era.
Agnostic estimation of mean and covariance
Kevin A Lai, Anup B Rao, and Santosh Vempala · 2016
Cited alongside, same era.
Learning communities in the presence of errors
Konstantin Makarychev, Yury Makarychev, and Aravindan Vijayaraghavan · 2016
Cited alongside, same era.
How robust are reconstruction thresholds for community detection?
Ankur Moitra, William Perry, and Alexander S Wein · 2016
Cited alongside, same era.
Minimax rates of community detection in stochastic block models
Anderson Y Zhang and Harrison H Zhou · 2016
Cited alongside, same era.
Community detection and stochastic block models: recent developments
Emmanuel Abbe · 2017
Cited alongside, same era.
Robust estimators in high-dimensions without the computational intractability
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2019
Later among the works it cites.
Sever: A robust meta-algorithm for stochastic optimization
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Jacob Steinhardt, and Alistair Stewart · 2019
Later among the works it cites.
Robustness of spectral methods for community detection
Ludovic Stephan and Laurent Massoulié · 2019
Later among the works it cites.
Robustly learning mixtures of k k arbitrary gaussians, 2020
Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, and Santosh S. Vempala · 2020
Later among the works it cites.
Online and distribution-free robustness: Regression and contextual bandits with huber contamination
Sitan Chen, Frederic Koehler, Ankur Moitra, and Morris Yau · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Being robust (in high dimensions) can be practical
Ilias Diakonikolas, Gautam Kamath, Daniel M Kane, Jerry Li, Ankur Moitra, and Alistair Stewart · 2017
Cited alongside, same era.
Bayesian estimation from few samples: community detection and related problems
Samuel B. Hopkins and David Steurer · 2017
Cited alongside, same era.
A semidefinite program for unbalanced multisection in the stochastic block model
Amelia Perry and Alexander S Wein · 2017
Cited alongside, same era.
Mixture models, robustness, and sum of squares proofs
Samuel B Hopkins and Jerry Li · 2018
Cited alongside, same era.
Efficient algorithms for outlier-robust regression
Adam Klivans, Pravesh K Kothari, and Raghu Meka · 2018
Cited alongside, same era.
A proof of the block model threshold conjecture
Elchanan Mossel, Joe Neeman, and Allan Sly · 2018
Cited alongside, same era.
Achieving the bayes error rate in synchronization and block models by sdp, robustly
Yingjie Fei and Yudong Chen · 2020
Later among the works it cites.
Robust estimation for random graphs
Jayadev Acharya, Ayush Jain, Gautam Kamath, Ananda Theertha Suresh, and Huanyu Zhang · 2021
Later among the works it cites.
Local statistics, semidefinite programming, and community detection
Jess Banks, Sidhanth Mohanty, and Prasad Raghavendra · 2021
Later among the works it cites.
Robust linear regression: Optimal rates in polynomial time
Ainesh Bakshi and Adarsh Prasad · 2021
Later among the works it cites.
Learning gmms with nearly optimal robustness guarantees
Allen Liu and Ankur Moitra · 2021
Later among the works it cites.
Settling the robust learnability of mixtures of gaussians
Allen Liu and Ankur Moitra · 2021
Later among the works it cites.
Robust recovery for stochastic block models
Jingqiu Ding, Tommaso d’Orsi, Rajai Nasser, and David Steurer · 2022
Closest in time.