{"total":38,"rows":[{"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":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","cited_by_count":21,"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":"2206.05265","title":"When Does Adaptivity Help for Quantum State Learning?","created":"2022-06-10","cited_by_count":12,"area":null},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10,"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":"2212.13677","title":"A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation","created":"2022-12-28","cited_by_count":8,"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":"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":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2409.00966","title":"A computational transition for detecting correlated stochastic block models by low-degree polynomials","created":"2024-09-02","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":"2311.00289","title":"Precise Error Rates for Computationally Efficient Testing","created":"2023-11-01","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":"2301.11124","title":"SQ Lower Bounds for Random Sparse Planted Vector Problem","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2409.03335","title":"Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data","created":"2024-09-05","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":"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":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","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":"2402.00305","title":"Information-Theoretic Thresholds for Planted Dense Cycles","created":"2024-02-01","cited_by_count":2,"area":null},{"id":"2506.06259","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","created":"2025-06-06","cited_by_count":2,"area":null},{"id":"2511.19398","title":"PTF Testing Lower Bounds for Non-Gaussian Component Analysis","created":"2025-11-24","cited_by_count":2,"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":"2408.01336","title":"Sparse Linear Regression when Noises and Covariates are Heavy-Tailed and Contaminated by Outliers","created":"2024-08-02","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":"2504.08332","title":"High-dimensional Clustering and Signal Recovery under Block Signals","created":"2025-04-11","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":"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},{"id":"2610.17971","title":"Rarity Determines Minimax Rates of Semantic Entropy From Weak Pairwise Judgments With a Known Channel","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}