{"total":21,"rows":[{"id":"2112.00706","title":"Clustering Mixtures with Almost Optimal Separation in Polynomial Time","created":"2021-12-01","cited_by_count":28,"area":null},{"id":"2304.10524","title":"Learning Narrow One-Hidden-Layer ReLU Networks","created":"2023-04-20","cited_by_count":14,"area":null},{"id":"2208.10521","title":"Estimation Contracts for Outlier-Robust Geometric Perception","created":"2022-08-22","cited_by_count":11,"area":null},{"id":"2101.01509","title":"SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation","created":"2021-01-05","cited_by_count":7,"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":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2202.06442","title":"Fast algorithm for overcomplete order-3 tensor decomposition","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2302.09347","title":"Closed-Loop Transcription via Convolutional Sparse Coding","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2210.10855","title":"Dictionary Learning for the Almost-Linear Sparsity Regime","created":"2022-10-19","cited_by_count":3,"area":null},{"id":"2211.03827","title":"Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models","created":"2022-11-07","cited_by_count":3,"area":null},{"id":"2212.03851","title":"Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond","created":"2022-12-07","cited_by_count":2,"area":null},{"id":"2111.07834","title":"Conditional Linear Regression for Heterogeneous Covariances","created":"2021-11-15","cited_by_count":1,"area":null},{"id":"2204.07879","title":"Polynomial-time Sparse Measure Recovery: From Mean Field Theory to Algorithm Design","created":"2022-04-16","cited_by_count":1,"area":null},{"id":"2405.18412","title":"Tensor Methods in High Dimensional Data Analysis: Opportunities and Challenges","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2510.07732","title":"Rotated Mean-Field Variational Inference and Iterative Gaussianization","created":"2025-10-09","cited_by_count":1,"area":null},{"id":"2302.10844","title":"Robust Mean Estimation Without Moments for Symmetric Distributions","created":"2023-02-21","cited_by_count":0,"area":null},{"id":"2411.01721","title":"Computational Lower Bounds for Regret Minimization in Normal-Form Games","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2411.14344","title":"Overcomplete Tensor Decomposition via Koszul-Young Flattenings","created":"2024-11-21","cited_by_count":0,"area":null},{"id":"2505.20532","title":"Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation","created":"2025-05-26","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}],"next_cursor":null}