| Settling the robust learnability of mixtures of gaussians A Liu, A Moitra Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 46 | 2021 |
| Efficiently learning mixtures of mallows models A Liu, A Moitra 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 41 | 2018 |
| Tensor completion made practical A Liu, A Moitra Advances in Neural Information Processing Systems 33, 18905-18916, 2020 | 37 | 2020 |
| When does adaptivity help for quantum state learning? S Chen, B Huang, J Li, A Liu, M Sellke 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 31* | 2023 |
| Fourier and circulant matrices are not rigid Z Dvir, A Liu arXiv preprint arXiv:1902.07334, 2019 | 26 | 2019 |
| Variable decomposition for prophet inequalities and optimal ordering A Liu, RP Leme, M Pál, J Schneider, B Sivan arXiv preprint arXiv:2004.10163, 2020 | 25 | 2020 |
| Optimal contextual pricing and extensions A Liu, RP Leme, J Schneider Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24 | 2021 |
| Minimax rates for robust community detection A Liu, A Moitra 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 16 | 2022 |
| Clustering mixtures with almost optimal separation in polynomial time A Liu, J Li Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 16 | 2022 |
| Tight bounds for quantum state certification with incoherent measurements S Chen, J Li, B Huang, A Liu 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Better algorithms for estimating non-parametric models in crowd-sourcing and rank aggregation A Liu, A Moitra Conference on Learning Theory, 2780-2829, 2020 | 12 | 2020 |
| Learning gmms with nearly optimal robustness guarantees A Liu, A Moitra Conference on Learning Theory, 2815-2895, 2022 | 11 | 2022 |
| Learning quantum hamiltonians at any temperature in polynomial time A Bakshi, A Liu, A Moitra, E Tang arXiv preprint arXiv:2310.02243, 2023 | 10 | 2023 |
| Semi-random sparse recovery in nearly-linear time J Kelner, J Li, AX Liu, A Sidford, K Tian The Thirty Sixth Annual Conference on Learning Theory, 2352-2398, 2023 | 8 | 2023 |
| Estimates for Bilinear Generalized Radon Transforms in the Plane A Greenleaf, A Iosevich, B Krause, A Liu Combinatorial and Additive Number Theory, New York Number Theory Seminar …, 2021 | 8* | 2021 |
| A new approach to learning linear dynamical systems A Bakshi, A Liu, A Moitra, M Yau Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 335-348, 2023 | 7 | 2023 |
| Algorithms from Invariants: Smoothed Analysis of Orbit Recovery over A Liu, A Moitra arXiv preprint arXiv:2106.02680, 2021 | 7 | 2021 |
| Robust voting rules from algorithmic robust statistics A Liu, A Moitra Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 6 | 2023 |
| Sparsification for sums of exponentials and its algorithmic applications J Li, A Liu, A Moitra arXiv preprint arXiv:2106.02774, 2021 | 4 | 2021 |
| High-Temperature Gibbs States are Unentangled and Efficiently Preparable A Bakshi, A Liu, A Moitra, E Tang arXiv preprint arXiv:2403.16850, 2024 | 3 | 2024 |
Ankur MoitraNorbert Wiener Professor of Mathematics, MITVerified email at mit.edu
