{"total":34,"rows":[{"id":"2305.10690","title":"Sampling, Diffusions, and Stochastic Localization","created":"2023-05-18","cited_by_count":40,"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":"2208.03113","title":"On the non-universality of deep learning: quantifying the cost of symmetry","created":"2022-08-05","cited_by_count":18,"area":null},{"id":"2108.12163","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","created":"2021-08-27","cited_by_count":17,"area":null},{"id":"2310.01762","title":"Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization","created":"2023-10-03","cited_by_count":10,"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":"2212.10872","title":"Is it easier to count communities than find them?","created":"2022-12-21","cited_by_count":5,"area":null},{"id":"2302.06737","title":"Detection-Recovery Gap for Planted Dense Cycles","created":"2023-02-13","cited_by_count":4,"area":null},{"id":"2411.01974","title":"On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance","created":"2024-11-04","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":"2110.00744","title":"Random Subgraph Detection Using Queries","created":"2021-10-02","cited_by_count":3,"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":"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":"2203.02824","title":"Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs","created":"2022-03-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":"2302.10158","title":"Sparse PCA Beyond Covariance Thresholding","created":"2023-02-20","cited_by_count":2,"area":null},{"id":"2306.05679","title":"Bayes optimal learning in high-dimensional linear regression with network side information","created":"2023-06-09","cited_by_count":2,"area":null},{"id":"2404.12418","title":"The graph alignment problem: fundamental limits and efficient algorithms","created":"2024-04-18","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":"2201.01825","title":"Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning","created":"2022-01-05","cited_by_count":1,"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":"2505.18372","title":"Optimal community detection in dense bipartite graphs","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2102.11658","title":"A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix","created":"2021-02-23","cited_by_count":0,"area":null},{"id":"2107.11886","title":"Logspace Reducibility From Secret Leakage Planted Clique","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2304.04043","title":"Statistical and computational rates in high rank tensor estimation","created":"2023-04-08","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":"2402.07717","title":"Computationally efficient reductions between some statistical models","created":"2024-02-12","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":"2512.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null}],"next_cursor":null}