{"total":53,"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":"2305.10690","title":"Sampling, Diffusions, and Stochastic Localization","created":"2023-05-18","cited_by_count":40,"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":"2106.09689","title":"Statistical Query Lower Bounds for List-Decodable Linear Regression","created":"2021-06-17","cited_by_count":25,"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":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","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":"2206.08756","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","created":"2022-06-17","cited_by_count":15,"area":null},{"id":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14,"area":null},{"id":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14,"area":null},{"id":"2404.08602","title":"Sliding down the stairs: how correlated latent variables accelerate learning with neural networks","created":"2024-04-12","cited_by_count":12,"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":"2506.05500","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","created":"2025-06-05","cited_by_count":9,"area":null},{"id":"2404.18735","title":"Tensor cumulants for statistical inference on invariant distributions","created":"2024-04-29","cited_by_count":8,"area":null},{"id":"2106.06308","title":"The Complexity of Sparse Tensor PCA","created":"2021-06-11","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":"2303.02118","title":"Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression","created":"2023-03-03","cited_by_count":7,"area":null},{"id":"2304.08135","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","created":"2023-04-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":"2211.07327","title":"Higher degree sum-of-squares relaxations robust against oblivious outliers","created":"2022-11-14","cited_by_count":6,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","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":"2212.10872","title":"Is it easier to count communities than find them?","created":"2022-12-21","cited_by_count":5,"area":null},{"id":"2208.09493","title":"Near-optimal fitting of ellipsoids to random points","created":"2022-08-19","cited_by_count":4,"area":null},{"id":"2302.06737","title":"Detection-Recovery Gap for Planted Dense Cycles","created":"2023-02-13","cited_by_count":4,"area":null},{"id":"2310.11876","title":"SQ Lower Bounds for Learning Mixtures of Linear Classifiers","created":"2023-10-18","cited_by_count":4,"area":null},{"id":"2311.00289","title":"Precise Error Rates for Computationally Efficient Testing","created":"2023-11-01","cited_by_count":4,"area":null},{"id":"2402.14103","title":"Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression","created":"2024-02-21","cited_by_count":4,"area":null},{"id":"2511.21526","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities (II)","created":"2025-11-26","cited_by_count":4,"area":null},{"id":"2312.14922","title":"Learning from higher-order statistics, efficiently: hypothesis tests, random features, and neural networks","created":"2023-12-22","cited_by_count":3,"area":null},{"id":"2412.21155","title":"Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models","created":"2024-12-30","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":"2502.15024","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","created":"2025-02-20","cited_by_count":3,"area":null},{"id":"2509.15822","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities","created":"2025-09-19","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":"2402.00305","title":"Information-Theoretic Thresholds for Planted Dense Cycles","created":"2024-02-01","cited_by_count":2,"area":null},{"id":"2502.11413","title":"Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-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":"2406.04868","title":"Perturb-and-Project: Differentially Private Similarities and Marginals","created":"2024-06-07","cited_by_count":1,"area":null},{"id":"2107.11886","title":"Logspace Reducibility From Secret Leakage Planted Clique","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2402.05451","title":"Low-degree phase transitions for detecting a planted clique in sublinear time","created":"2024-02-08","cited_by_count":0,"area":null},{"id":"2403.09742","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","created":"2024-03-13","cited_by_count":0,"area":null},{"id":"2406.05428","title":"Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs","created":"2024-06-08","cited_by_count":0,"area":null},{"id":"2409.14870","title":"Testing Dependency of Weighted Random Graphs","created":"2024-09-23","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":"2506.19273","title":"A large deviation view of \\emph{stationarized} fully lifted blirp interpolation","created":"2025-06-24","cited_by_count":0,"area":null},{"id":"2509.09904","title":"A Smooth Computational Transition in Tensor PCA","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2510.08541","title":"Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2512.00610","title":"Statistical-computational gap in multiple Gaussian graph alignment","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2512.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null},{"id":"2602.23023","title":"Low-degree Lower bounds for clustering in moderate dimension","created":"2026-02-26","cited_by_count":0,"area":null}],"next_cursor":null}