Suivre
Yeshwanth Cherapanamjeri
Yeshwanth Cherapanamjeri
Ph.D Student, UC Berkeley
Adresse e-mail validée de berkeley.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Nearly optimal robust matrix completion
Y Cherapanamjeri, K Gupta, P Jain
International Conference on Machine Learning, 797-805, 2017
1082017
Fast mean estimation with sub-gaussian rates
Y Cherapanamjeri, N Flammarion, PL Bartlett
Conference on Learning Theory, 786-806, 2019
792019
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
422020
Thresholding based outlier robust PCA
Y Cherapanamjeri, P Jain, P Netrapalli
Conference on Learning Theory, 593-628, 2017
392017
Optimal Robust Linear Regression in Nearly Linear Time
Y Cherapanamjeri, E Aras, N Tripuraneni, MI Jordan, N Flammarion, ...
arXiv preprint arXiv:2007.08137, 2020
382020
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
332020
Adversarial examples in multi-layer random relu networks
P Bartlett, S Bubeck, Y Cherapanamjeri
Advances in Neural Information Processing Systems 34, 9241-9252, 2021
282021
Optimal mean estimation without a variance
Y Cherapanamjeri, N Tripuraneni, P Bartlett, M Jordan
Conference on Learning Theory, 356-357, 2022
232022
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
232021
On Adaptive Distance Estimation
Y Cherapanamjeri, J Nelson
Advances in Neural Information Processing Systems 33, 2020
232020
Terminal embeddings in sublinear time
Y Cherapanamjeri, J Nelson
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
192022
Testing symmetric markov chains without hitting
Y Cherapanamjeri, PL Bartlett
Conference on Learning Theory, 758-785, 2019
182019
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
122022
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
72023
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
72023
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
62022
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
52023
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
52023
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
42023
Statistical Barriers to Affine-equivariant Estimation
Z Chen, Y Cherapanamjeri
arXiv preprint arXiv:2310.10758, 2023
12023
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20