Sanjeev Arora

Cited by

	All	Since 2020
Citations	39757	18527
h-index	81	61
i10-index	152	123

4500

2250

1125

3375

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025142 159 227 267 364 341 324 330 354 397 377 559 601 674 598 751 803 876 1038 1151 1341 1257 1442 1586 2014 2467 2980 3260 3679 3921 4427 253

Public access

View all

38 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Rong GeDuke UniversityVerified email at cs.duke.edu
Tengyu MAStanford UniversityVerified email at stanford.edu
Zhiyuan LiAssistant Professor, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonVerified email at princeton.edu
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Yingyu LiangUW-MadisonVerified email at cs.wisc.edu
Yi ZhangSenior Researcher at Microsoft Research RedmondVerified email at microsoft.com
Nikunj SaunshiResearch Scientist, GoogleVerified email at google.com
Ankur MoitraNorbert Wiener Professor of Mathematics, MITVerified email at mit.edu
Wei HuAssistant Professor of Computer Science and Engineering, University of MichiganVerified email at umich.edu
Satyen KaleResearch Scientist, AppleVerified email at satyenkale.com
Andrej RisteskiCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Simon Shaolei DuAssistant Professor, School of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Mikhail KhodakCMUVerified email at cs.princeton.edu
Ruosong WangAssistant Professor, Peking UniversityVerified email at pku.edu.cn
Satish B RaoVerified email at berkeley.edu
Dingli YuMicrosoft ResearchVerified email at microsoft.com
Nadav CohenAssoc. Professor of Computer Science, Tel Aviv University | CTO, President & Co-Founder, ImubitVerified email at tauex.tau.ac.il
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu

Sanjeev Arora

Professor of Computer Science, Princeton University

Verified email at cs.princeton.edu - Homepage

theoretical machine learning theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Computational complexity: a modern approach S Arora, B Barak Cambridge University Press, 2009	5204	2009
Proof verification and the hardness of approximation problems S Arora, C Lund, R Motwani, M Sudan, M Szegedy Journal of the ACM (JACM) 45 (3), 501-555, 1998	3195	1998
Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998	1900	1998
A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma International conference on learning representations, 2017	1756	2017
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems S Arora Journal of the ACM (JACM) 45 (5), 753-782, 1998	1481	1998
The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of computing 8 (1), 121-164, 2012	1292	2012
Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks S Arora, S Du, W Hu, Z Li, R Wang International Conference on Machine Learning, 322-332, 2019	1110	2019
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	1050	2009
On exact computation with an infinitely wide neural net S Arora, SS Du, W Hu, Z Li, R Salakhutdinov, R Wang Neurips 2019 arXiv preprint arXiv:1904.11955, 2019	1049	2019
Generalization and equilibrium in generative adversarial nets (gans) S Arora, R Ge, Y Liang, T Ma, Y Zhang International conference on machine learning, 224-232, 2017	836	2017
Stronger generalization bounds for deep nets via a compression approach S Arora, R Ge, B Neyshabur, Y Zhang International conference on machine learning, 254-263, 2018	716	2018
The hardness of approximate optima in lattices, codes, and systems of linear equations S Arora, L Babai, J Stern, Z Sweedyk Journal of Computer and System Sciences 54 (2), 317-331, 1997	631	1997
A latent variable model approach to pmi-based word embeddings S Arora, Y Li, Y Liang, T Ma, A Risteski Transactions of the Association for Computational Linguistics 4, 385-399, 2016	618	2016
Polynomial time approximation schemes for Euclidean TSP and other geometric problems S Arora Proceedings of 37th Conference on Foundations of Computer Science, 2-11, 1996	616	1996
Implicit regularization in deep matrix factorization S Arora, N Cohen, W Hu, Y Luo Advances in Neural Information Processing Systems 32, 2019	596	2019
Polynomial time approximation schemes for dense instances of NP-hard problems S Arora, D Karger, M Karpinski Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	588	1995
On the optimization of deep networks: Implicit acceleration by overparameterization S Arora, N Cohen, E Hazan International conference on machine learning, 244-253, 2018	579	2018
A practical algorithm for topic modeling with provable guarantees S Arora, R Ge, Y Halpern, D Mimno, A Moitra, D Sontag, Y Wu, M Zhu International conference on machine learning, 280-288, 2013	568	2013
Learning topic models--going beyond SVD S Arora, R Ge, A Moitra 2012 IEEE 53rd annual symposium on foundations of computer science, 1-10, 2012	563	2012
Approximation schemes for Euclidean k-medians and related problems S Arora, P Raghavan, S Rao Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	545	1998

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors