{"total":25,"rows":[{"id":"2111.12981","title":"Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism","created":"2021-11-25","cited_by_count":50,"area":null},{"id":"2212.05015","title":"Robustness Implies Privacy in Statistical Estimation","created":"2022-12-09","cited_by_count":47,"area":null},{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31,"area":null},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"area":null},{"id":"2211.00724","title":"Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation","created":"2022-11-01","cited_by_count":25,"area":null},{"id":"2111.08568","title":"Robust recovery for stochastic block models","created":"2021-11-16","cited_by_count":18,"area":null},{"id":"2206.07640","title":"Statistical and Computational Phase Transitions in Group Testing","created":"2022-06-15","cited_by_count":10,"area":null},{"id":"2101.01509","title":"SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation","created":"2021-01-05","cited_by_count":7,"area":null},{"id":"2211.13291","title":"Learning and Testing Latent-Tree Ising Models Efficiently","created":"2022-11-23","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":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2311.09017","title":"Semidefinite programs simulate approximate message passing robustly","created":"2023-11-15","cited_by_count":6,"area":null},{"id":"2112.05445","title":"Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures","created":"2021-12-10","cited_by_count":5,"area":null},{"id":"2311.00289","title":"Precise Error Rates for Computationally Efficient Testing","created":"2023-11-01","cited_by_count":4,"area":null},{"id":"2403.07862","title":"Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing","created":"2024-03-12","cited_by_count":3,"area":null},{"id":"2403.12213","title":"Private graphon estimation via sum-of-squares","created":"2024-03-18","cited_by_count":3,"area":null},{"id":"2502.09832","title":"Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2110.01901","title":"Inferring Hidden Structures in Random Graphs","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","cited_by_count":2,"area":null},{"id":"2405.16663","title":"Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust","created":"2024-05-26","cited_by_count":2,"area":null},{"id":"2412.02670","title":"The Broader Landscape of Robustness in Algorithmic Statistics","created":"2024-12-03","cited_by_count":2,"area":null},{"id":"2111.07834","title":"Conditional Linear Regression for Heterogeneous Covariances","created":"2021-11-15","cited_by_count":1,"area":null},{"id":"2503.03923","title":"Improved Robust Estimation for Erd\\H{o}s-R\\'enyi Graphs: The Sparse Regime and Optimal Breakdown Point","created":"2025-03-05","cited_by_count":0,"area":null},{"id":"2504.03097","title":"A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2609.30105","title":"On the SoS Certifiability of Log-Concave Distributions","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}