Sanjeev Arora

Cited by

	All	Since 2017
Citations	28892	13646
h-index	69	49
i10-index	133	102

3400

1700

850

2550

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202274 150 154 206 245 364 319 341 323 331 406 413 582 585 651 579 754 800 896 1074 1173 1378 1314 1528 1649 2015 2533 2989 3370 1075

Public access

View all

42 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
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Yingyu LiangUniversity of Wisconsin-MadisonVerified email at cs.wisc.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonVerified email at cs.princeton.edu
Zhiyuan LiGraduate Student, Princeton UniversityVerified email at princeton.edu
Ankur MoitraNorbert Wiener Professor of Mathematics, MITVerified email at mit.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Yi ZhangPostdoctoral Researcher at Microsoft Research RedmondVerified email at microsoft.com
Satyen KaleStaff Research Scientist, Google ResearchVerified email at google.com
Andrej RisteskiCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Wei HuUniversity of California, BerkeleyVerified email at berkeley.edu
Simon Shaolei DuAssistant Professor, School of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu
Satish B RaoVerified email at berkeley.edu
Ruosong WangPhD Student, Carnegie Mellon UniversityVerified email at andrew.cmu.edu
David SteurerETH ZürichVerified email at inf.ethz.ch
Nikunj SaunshiPrinceton UniversityVerified email at princeton.edu
Mikhail KhodakCMUVerified email at cs.princeton.edu
Nadav CohenAsst. Professor of Computer Science, Tel Aviv UniversityVerified email at cs.tau.ac.il

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	3775	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	2868	1998
Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998	1655	1998
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems S Arora Journal of the ACM (JACM) 45 (5), 753-782, 1998	1308	1998
A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma International conference on learning representations, 2017	1131	2017
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	917	2009
The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of computing 8 (1), 121-164, 2012	905	2012
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	568	1997
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	556	2017
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	553	1996
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	543	2019
Polynomial time approximation schemes for dense instances of NP-hard problems S Arora, D Karger, M Karpinski Journal of computer and system sciences 58 (1), 193-210, 1999	536	1999
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	482	2019
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	479	1998
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	458	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	458	2012
Computing a nonnegative matrix factorization---provably S Arora, R Ge, R Kannan, A Moitra SIAM Journal on Computing 45 (4), 1582-1611, 2016	446	2016
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	439	2018
Hardness of approximations S Arora, C Lund Approximation algorithms for NP-hard problems, 399-446, 1996	433	1996
Provable bounds for learning some deep representations S Arora, A Bhaskara, R Ge, T Ma International conference on machine learning, 584-592, 2014	383	2014

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 this author

Cited by

Co-authors