{"total":85,"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":"2403.05529","title":"Computational-Statistical Gaps in Gaussian Single-Index Models","created":"2024-03-08","cited_by_count":44,"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":"2106.09689","title":"Statistical Query Lower Bounds for List-Decodable Linear Regression","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","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":"2408.03733","title":"Bayes-optimal learning of an extensive-width neural network from quadratically many samples","created":"2024-08-07","cited_by_count":23,"area":null},{"id":"2110.11816","title":"Testing network correlation efficiently via counting trees","created":"2021-10-22","cited_by_count":22,"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":"2106.10744","title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","created":"2021-06-20","cited_by_count":20,"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":"2407.05622","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries","created":"2024-07-08","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":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14,"area":null},{"id":"2209.13723","title":"Statistical limits of correlation detection in trees","created":"2022-09-27","cited_by_count":12,"area":null},{"id":"2404.08602","title":"Sliding down the stairs: how correlated latent variables accelerate learning with neural networks","created":"2024-04-12","cited_by_count":12,"area":null},{"id":"2407.00745","title":"Posterior Sampling with Denoising Oracles via Tilted Transport","created":"2024-06-30","cited_by_count":12,"area":"diffusion"},{"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":"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":"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":"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":"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":"2201.09040","title":"Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures","created":"2022-01-22","cited_by_count":6,"area":null},{"id":"2209.02001","title":"On free energy barriers in Gaussian priors and failure of cold start MCMC for high-dimensional unimodal distributions","created":"2022-09-05","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":"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":"2403.02300","title":"Statistical Query Lower Bounds for Learning Truncated Gaussians","created":"2024-03-04","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":"2207.04600","title":"Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model","created":"2022-07-11","cited_by_count":5,"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":"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":"2208.09493","title":"Near-optimal fitting of ellipsoids to random points","created":"2022-08-19","cited_by_count":4,"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":"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":"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":"2605.05076","title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","created":"2026-05-06","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":"2404.03272","title":"Cryptographic Hardness of Score Estimation","created":"2024-04-04","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":"2502.09832","title":"Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity","created":"2025-02-14","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":"2503.08028","title":"Computational bottlenecks for denoising diffusions","created":"2025-03-11","cited_by_count":3,"area":"diffusion"},{"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":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","cited_by_count":2,"area":null},{"id":"2302.10158","title":"Sparse PCA Beyond Covariance Thresholding","created":"2023-02-20","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":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2303.05024","title":"Phase transition for detecting a small community in a large network","created":"2023-03-09","cited_by_count":1,"area":null},{"id":"2505.01484","title":"LLM Watermarking Using Mixtures and Statistical-to-Computational Gaps","created":"2025-05-02","cited_by_count":1,"area":"safety"},{"id":"2603.16798","title":"High-Dimensional Gaussian Mean Estimation under Realizable Contamination","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2603.18254","title":"Computation-Utility-Privacy Tradeoffs in Bayesian Estimation","created":"2026-03-18","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":"2212.04016","title":"Quantum-Inspired Approximations to Constraint Satisfaction Problems","created":"2022-12-08","cited_by_count":0,"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":"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":"2402.07717","title":"Computationally efficient reductions between some statistical models","created":"2024-02-12","cited_by_count":0,"area":null},{"id":"2406.05428","title":"Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs","created":"2024-06-08","cited_by_count":0,"area":null},{"id":"2409.14870","title":"Testing Dependency of Weighted Random Graphs","created":"2024-09-23","cited_by_count":0,"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},{"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":"2510.08541","title":"Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise","created":"2025-10-09","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":"2605.16913","title":"A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights","created":"2026-05-16","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":"2610.07503","title":"Two-Sample Testing for Random Graphs without Vertex Correspondence","created":"2026-10-05","cited_by_count":0,"area":null},{"id":"2610.08872","title":"Slow Beats Fast at the Kesten-Stigum Threshold: Minimax, Fisher-Information and Belief-Propagation Characterizations of the Information-Computation Gap in Sparse Stochastic Block Models","created":"2026-10-06","cited_by_count":0,"area":null}],"next_cursor":null}