{"total":41,"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":"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.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":"2402.07240","title":"Oja's Algorithm for Streaming Sparse PCA","created":"2024-02-11","cited_by_count":9,"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":"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":"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":"2207.04600","title":"Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model","created":"2022-07-11","cited_by_count":5,"area":null},{"id":"2206.08092","title":"On the well-spread property and its relation to linear regression","created":"2022-06-16","cited_by_count":4,"area":null},{"id":"2209.14790","title":"Sparse PCA With Multiple Components","created":"2022-09-29","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":"2410.14092","title":"Efficient Sparse PCA via Block-Diagonalization","created":"2024-10-18","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":"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":"2409.03335","title":"Semi-Supervised Sparse Gaussian Classification: Provable Benefits of Unlabeled Data","created":"2024-09-05","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":"2412.21203","title":"SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More","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":"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.10158","title":"Sparse PCA Beyond Covariance Thresholding","created":"2023-02-20","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":"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":"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":"2507.09148","title":"A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation","created":"2025-07-12","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.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null},{"id":"2603.02607","title":"Combinatorial Sparse PCA Beyond the Spiked Identity Model","created":"2026-03-03","cited_by_count":0,"area":null},{"id":"2606.11149","title":"Efficiently Learning Drifting Halfspaces with Massart Noise","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2606.14335","title":"Recovery thresholds for hidden weighted sparse graphs","created":"2026-06-12","cited_by_count":0,"area":null}],"next_cursor":null}