{"total":25,"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":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28,"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":"2403.04744","title":"SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions","created":"2024-03-07","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":"2303.02118","title":"Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression","created":"2023-03-03","cited_by_count":7,"area":null},{"id":"2201.09040","title":"Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures","created":"2022-01-22","cited_by_count":6,"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":"2410.21426","title":"Sum-of-squares lower bounds for Non-Gaussian Component Analysis","created":"2024-10-28","cited_by_count":6,"area":null},{"id":"2112.05445","title":"Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures","created":"2021-12-10","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":"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":"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":"2404.03272","title":"Cryptographic Hardness of Score Estimation","created":"2024-04-04","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":"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":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2402.14645","title":"Sparse Linear Regression and Lattice Problems","created":"2024-02-22","cited_by_count":1,"area":null},{"id":"2410.03477","title":"On the Hardness of Learning One Hidden Layer Neural Networks","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2502.02668","title":"Recovering Imbalanced Clusters via Gradient-Based Projection Pursuit","created":"2025-02-04","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}],"next_cursor":null}