{"total":28,"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":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"area":null},{"id":"2110.11816","title":"Testing network correlation efficiently via counting trees","created":"2021-10-22","cited_by_count":22,"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":"2307.10155","title":"Curvature-based Clustering on Graphs","created":"2023-07-19","cited_by_count":14,"area":null},{"id":"2401.01869","title":"On the hardness of learning under symmetries","created":"2024-01-03","cited_by_count":13,"area":null},{"id":"2207.11903","title":"Minimax Rates for Robust Community Detection","created":"2022-07-25","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":"2105.08005","title":"Learning a Latent Simplex in Input-Sparsity Time","created":"2021-05-17","cited_by_count":11,"area":null},{"id":"2106.06308","title":"The Complexity of Sparse Tensor PCA","created":"2021-06-11","cited_by_count":7,"area":null},{"id":"2203.02790","title":"A Robust Spectral Algorithm for Overcomplete Tensor Decomposition","created":"2022-03-05","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":"2305.00979","title":"Spectral clustering in the Gaussian mixture block model","created":"2023-04-29","cited_by_count":7,"area":null},{"id":"2305.10227","title":"Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions","created":"2023-05-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":"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":"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":"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":"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":"2402.00305","title":"Information-Theoretic Thresholds for Planted Dense Cycles","created":"2024-02-01","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":"2302.02096","title":"Matrix Estimation for Individual Fairness","created":"2023-02-04","cited_by_count":1,"area":null},{"id":"2106.04805","title":"Streaming Belief Propagation for Community Detection","created":"2021-06-09","cited_by_count":0,"area":null},{"id":"2107.11886","title":"Logspace Reducibility From Secret Leakage Planted Clique","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2307.11371","title":"Random Separating Hyperplane Theorem and Learning Polytopes","created":"2023-07-21","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}],"next_cursor":null}