{"total":19,"rows":[{"id":"2310.04064","title":"How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation","created":"2023-10-06","cited_by_count":44,"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.08537","title":"Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation","created":"2021-06-16","cited_by_count":21,"area":null},{"id":"2107.10209","title":"Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations","created":"2021-07-21","cited_by_count":15,"area":null},{"id":"2302.07426","title":"Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy","created":"2023-02-15","cited_by_count":10,"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":"2302.12289","title":"Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error","created":"2023-02-23","cited_by_count":4,"area":null},{"id":"2309.13993","title":"Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity","created":"2023-09-25","cited_by_count":4,"area":null},{"id":"2106.02774","title":"Robust Model Selection and Nearly-Proper Learning for GMMs","created":"2021-06-05","cited_by_count":3,"area":null},{"id":"2203.15150","title":"Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures","created":"2022-03-28","cited_by_count":3,"area":null},{"id":"2210.03528","title":"Tractable Optimality in Episodic Latent MABs","created":"2022-10-05","cited_by_count":3,"area":null},{"id":"2106.02680","title":"Algorithms from Invariants: Smoothed Analysis of Orbit Recovery over $SO(3)$","created":"2021-06-04","cited_by_count":2,"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":"2107.01559","title":"Smoothed Differential Privacy","created":"2021-07-04","cited_by_count":1,"area":null},{"id":"2507.20459","title":"Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modeling","created":"2025-07-28","cited_by_count":1,"area":null},{"id":"2601.05157","title":"Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms","created":"2026-01-08","cited_by_count":1,"area":null},{"id":"2209.01006","title":"Johnson-Lindenstrauss embeddings for noisy vectors -- taking advantage of the noise","created":"2022-09-01","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}],"next_cursor":null}