| Nearly optimal robust matrix completion Y Cherapanamjeri, K Gupta, P Jain International Conference on Machine Learning, 797-805, 2017 | 114 | 2017 |
| Fast mean estimation with sub-gaussian rates Y Cherapanamjeri, N Flammarion, PL Bartlett Conference on Learning Theory, 786-806, 2019 | 89 | 2019 |
| Algorithms for heavy-tailed statistics: Regression, covariance estimation, and beyond Y Cherapanamjeri, SB Hopkins, T Kathuria, P Raghavendra, ... Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 48 | 2020 |
| Thresholding based outlier robust PCA Y Cherapanamjeri, P Jain, P Netrapalli Conference on Learning Theory, 593-628, 2017 | 41 | 2017 |
| Optimal Robust Linear Regression in Nearly Linear Time Y Cherapanamjeri, E Aras, N Tripuraneni, MI Jordan, N Flammarion, ... arXiv preprint arXiv:2007.08137, 2020 | 37 | 2020 |
| List decodable mean estimation in nearly linear time Y Cherapanamjeri, S Mohanty, M Yau 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 36 | 2020 |
| Adversarial examples in multi-layer random relu networks P Bartlett, S Bubeck, Y Cherapanamjeri Advances in Neural Information Processing Systems 34, 9241-9252, 2021 | 31 | 2021 |
| A single gradient step finds adversarial examples on random two-layers neural networks S Bubeck, Y Cherapanamjeri, G Gidel, R Tachet des Combes Advances in Neural Information Processing Systems 34, 10081-10091, 2021 | 29 | 2021 |
| Optimal mean estimation without a variance Y Cherapanamjeri, N Tripuraneni, P Bartlett, M Jordan Conference on Learning Theory, 356-357, 2022 | 27 | 2022 |
| On Adaptive Distance Estimation Y Cherapanamjeri, J Nelson Advances in Neural Information Processing Systems 33, 2020 | 25 | 2020 |
| Testing symmetric markov chains without hitting Y Cherapanamjeri, PL Bartlett Conference on Learning Theory, 758-785, 2019 | 21 | 2019 |
| Terminal embeddings in sublinear time Y Cherapanamjeri, J Nelson 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 19 | 2022 |
| Optimal pac bounds without uniform convergence I Aden-Ali, Y Cherapanamjeri, A Shetty, N Zhivotovskiy 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 13 | 2023 |
| Uniform approximations for randomized hadamard transforms with applications Y Cherapanamjeri, J Nelson Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 13 | 2022 |
| Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time Y Cherapanamjeri, S Silwal, DP Woodruff, S Zhou Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |
| Robust Algorithms on Adaptive Inputs from Bounded Adversaries Y Cherapanamjeri, S Silwal, DP Woodruff, F Zhang, Q Zhang, S Zhou arXiv preprint arXiv:2304.07413, 2023 | 8 | 2023 |
| The One-Inclusion Graph Algorithm is not Always Optimal I Aden-Ali, Y Cherapanamjeri, A Shetty, N Zhivotovskiy The Thirty Sixth Annual Conference on Learning Theory, 72-88, 2023 | 7 | 2023 |
| Estimation of standard auction models Y Cherapanamjeri, C Daskalakis, A Ilyas, M Zampetakis Proceedings of the 23rd ACM Conference on Economics and Computation, 602-603, 2022 | 6 | 2022 |
| What makes a good fisherman? linear regression under self-selection bias Y Cherapanamjeri, C Daskalakis, A Ilyas, M Zampetakis Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1699-1712, 2023 | 5 | 2023 |
| Statistical Barriers to Affine-equivariant Estimation Z Chen, Y Cherapanamjeri arXiv preprint arXiv:2310.10758, 2023 | 1 | 2023 |
Peter BartlettProfessor, EECS and Statistics, UC BerkeleyVerified email at cs.berkeley.edu
