{"total":51,"rows":[{"id":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61,"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":"2112.00706","title":"Clustering Mixtures with Almost Optimal Separation in Polynomial Time","created":"2021-12-01","cited_by_count":28,"area":null},{"id":"2106.09689","title":"Statistical Query Lower Bounds for List-Decodable Linear Regression","created":"2021-06-17","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.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.05245","title":"List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering","created":"2022-06-10","cited_by_count":13,"area":null},{"id":"2401.01869","title":"On the hardness of learning under symmetries","created":"2024-01-03","cited_by_count":13,"area":null},{"id":"2407.00966","title":"Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension","created":"2024-07-01","cited_by_count":11,"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":"2410.21194","title":"SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications","created":"2024-10-28","cited_by_count":10,"area":null},{"id":"2306.16352","title":"Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise","created":"2023-06-28","cited_by_count":9,"area":null},{"id":"2506.05500","title":"The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models","created":"2025-06-05","cited_by_count":9,"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":"2312.01547","title":"Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression","created":"2023-12-04","cited_by_count":7,"area":null},{"id":"2503.23896","title":"Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions","created":"2025-03-31","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":"2311.09017","title":"Semidefinite programs simulate approximate message passing robustly","created":"2023-11-15","cited_by_count":6,"area":null},{"id":"2403.02300","title":"Statistical Query Lower Bounds for Learning Truncated Gaussians","created":"2024-03-04","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":"2307.08438","title":"Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise","created":"2023-07-13","cited_by_count":5,"area":null},{"id":"2206.04589","title":"Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2310.11876","title":"SQ Lower Bounds for Learning Mixtures of Linear Classifiers","created":"2023-10-18","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":"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":"2312.14922","title":"Learning from higher-order statistics, efficiently: hypothesis tests, random features, and neural networks","created":"2023-12-22","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":"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":"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":"2302.10158","title":"Sparse PCA Beyond Covariance Thresholding","created":"2023-02-20","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":"2403.10547","title":"Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing","created":"2024-03-12","cited_by_count":2,"area":null},{"id":"2502.11413","title":"Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise","created":"2025-02-17","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":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2305.00966","title":"A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm","created":"2023-05-01","cited_by_count":1,"area":null},{"id":"2403.04726","title":"A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation","created":"2024-03-07","cited_by_count":1,"area":null},{"id":"2603.16798","title":"High-Dimensional Gaussian Mean Estimation under Realizable Contamination","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2604.04228","title":"Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2306.13057","title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","created":"2023-06-22","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":"2510.10665","title":"Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination","created":"2025-10-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":"2602.23023","title":"Low-degree Lower bounds for clustering in moderate dimension","created":"2026-02-26","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}],"next_cursor":null}