{"total":20,"rows":[{"id":"2204.07196","title":"Testing distributional assumptions of learning algorithms","created":"2022-04-14","cited_by_count":30,"area":null},{"id":"2301.04822","title":"Private estimation algorithms for stochastic block models and mixture models","created":"2023-01-11","cited_by_count":21,"area":null},{"id":"2111.08568","title":"Robust recovery for stochastic block models","created":"2021-11-16","cited_by_count":18,"area":null},{"id":"2203.04002","title":"Semi-Random Sparse Recovery in Nearly-Linear Time","created":"2022-03-08","cited_by_count":18,"area":null},{"id":"2207.11903","title":"Minimax Rates for Robust Community Detection","created":"2022-07-25","cited_by_count":12,"area":null},{"id":"2111.05320","title":"Robust Estimation for Random Graphs","created":"2021-11-09","cited_by_count":8,"area":null},{"id":"2305.00979","title":"Spectral clustering in the Gaussian mixture block model","created":"2023-04-29","cited_by_count":7,"area":null},{"id":"2305.10227","title":"Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions","created":"2023-05-17","cited_by_count":7,"area":null},{"id":"2302.00037","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","created":"2023-01-31","cited_by_count":5,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2402.07445","title":"Top-$K$ ranking with a monotone adversary","created":"2024-02-12","cited_by_count":3,"area":null},{"id":"2108.04729","title":"Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models","created":"2021-08-10","cited_by_count":2,"area":null},{"id":"2406.04857","title":"A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering","created":"2024-06-07","cited_by_count":2,"area":null},{"id":"2307.13535","title":"Do algorithms and barriers for sparse principal component analysis extend to other structured settings?","created":"2023-07-25","cited_by_count":1,"area":null},{"id":"2205.11677","title":"Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold","created":"2022-05-24","cited_by_count":0,"area":null},{"id":"2310.17878","title":"A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time","created":"2023-10-27","cited_by_count":0,"area":null},{"id":"2404.00768","title":"Adversarially-Robust Inference on Trees via Belief Propagation","created":"2024-03-31","cited_by_count":0,"area":null},{"id":"2508.02158","title":"Robust Detection of Planted Subgraphs in Semi-Random Models","created":"2025-08-04","cited_by_count":0,"area":null},{"id":"2607.04869","title":"Active Learning on Adversarially Corrupted Graphs","created":"2026-07-06","cited_by_count":0,"area":null}],"next_cursor":null}