Sanjeev Arora

Cited by

	All	Since 2018
Citations	31747	15259
h-index	72	49
i10-index	133	102

3700

1850

925

2775

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023140 159 217 265 349 311 316 318 346 392 380 617 592 660 577 739 783 882 1033 1151 1332 1248 1449 1596 1979 2500 2941 3307 3687 831

Public access

View all

29 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 LiPostdoc, Stanford UniversityVerified email at stanford.edu
Yingyu LiangUniversity of Wisconsin-MadisonVerified email at cs.wisc.edu
Boaz BarakHarvard UniversityVerified email at boazbarak.org
Elad HazanProfessor at Princeton University and Director Google AI PrincetonVerified email at princeton.edu
Yi ZhangSenior Researcher at Microsoft Research RedmondVerified email at microsoft.com
Ankur MoitraNorbert Wiener Professor of Mathematics, MITVerified email at mit.edu
Satyen KaleStaff Research Scientist, Google ResearchVerified email at google.com
Andrej RisteskiCarnegie Mellon UniversityVerified email at andrew.cmu.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Nikunj SaunshiResearch Scientist, GoogleVerified email at google.com
Wei HuAssistant Professor of Computer Science and Engineering, University of MichiganVerified email at umich.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
Mikhail KhodakCMUVerified email at cs.princeton.edu
David SteurerETH ZürichVerified email at inf.ethz.ch
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	4207	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	2970	1998
Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998	1732	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	1358	1998
A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma International conference on learning representations, 2017	1356	2017
The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of computing 8 (1), 121-164, 2012	1020	2012
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	953	2009
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	757	2019
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	671	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	659	2017
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	577	1997
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	573	1996
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	555	1995
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	549	2018
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	521	1998
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	505	2012
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	498	2013
Computing a nonnegative matrix factorization--provably S Arora, R Ge, R Kannan, A Moitra Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	470	2012
Hardness of approximations S Arora, C Lund Approximation algorithms for NP-hard problems, 399-446, 1996	434	1996
Provable bounds for learning some deep representations S Arora, A Bhaskara, R Ge, T Ma International conference on machine learning, 584-592, 2014	427	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

Cited by

Co-authors