{"total":50,"rows":[{"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":"2211.00724","title":"Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation","created":"2022-11-01","cited_by_count":25,"area":null},{"id":"2206.03441","title":"Robust Sparse Mean Estimation via Sum of Squares","created":"2022-06-07","cited_by_count":24,"area":null},{"id":"2106.09207","title":"On the Power of Preconditioning in Sparse Linear Regression","created":"2021-06-17","cited_by_count":15,"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":"2109.11515","title":"Outlier-Robust Sparse Estimation via Non-Convex Optimization","created":"2021-09-23","cited_by_count":14,"area":null},{"id":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14,"area":null},{"id":"2104.12031","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","created":"2021-04-24","cited_by_count":13,"area":null},{"id":"2211.16333","title":"Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions","created":"2022-11-29","cited_by_count":13,"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":"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":"2108.04428","title":"Tensor Principal Component Analysis in High Dimensional CP Models","created":"2021-08-10","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":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2107.01335","title":"Average-Case Communication Complexity of Statistical Problems","created":"2021-07-03","cited_by_count":5,"area":null},{"id":"2201.07401","title":"Multiway Spherical Clustering via Degree-Corrected Tensor Block Models","created":"2022-01-19","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":"2402.15409","title":"Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps","created":"2024-02-23","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":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","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":"2201.04315","title":"On the Statistical Complexity of Sample Amplification","created":"2022-01-12","cited_by_count":3,"area":null},{"id":"2306.13255","title":"Precise Asymptotic Generalization for Multiclass Classification with Overparameterized Linear Models","created":"2023-06-23","cited_by_count":3,"area":null},{"id":"2404.03272","title":"Cryptographic Hardness of Score Estimation","created":"2024-04-04","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":"2403.10416","title":"Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2205.07488","title":"Robust Testing in High-Dimensional Sparse Models","created":"2022-05-16","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":"2406.04868","title":"Perturb-and-Project: Differentially Private Similarities and Marginals","created":"2024-06-07","cited_by_count":1,"area":null},{"id":"2410.23937","title":"Robust Sparse Regression with Non-Isotropic Designs","created":"2024-10-31","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":"2112.12306","title":"Selective Multiple Power Iteration: from Tensor PCA to gradient-based exploration of landscapes","created":"2021-12-23","cited_by_count":0,"area":null},{"id":"2305.15276","title":"Sparse Mean Estimation in Adversarial Settings via Incremental Learning","created":"2023-05-24","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":"2507.13222","title":"Computational-Statistical Tradeoffs from NP-hardness","created":"2025-07-17","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":"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":"2610.20416","title":"Tracking a Small Set of Experts in Online Convex Optimization","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}