Sanjeev Arora

Citée par

	Toutes	Depuis 2017
Citations	29427	14445
indice h	70	48
indice i10	133	103

3400

1700

850

2550

19941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022148 152 206 246 366 311 332 322 340 405 404 572 584 651 584 756 801 886 1034 1147 1347 1236 1465 1590 1985 2516 2941 3331 2066

Accès public

Tout afficher

41 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Rong GeDuke UniversityAdresse e-mail validée de cs.duke.edu
Tengyu MAStanford UniversityAdresse e-mail validée de stanford.edu
Yingyu LiangUniversity of Wisconsin-MadisonAdresse e-mail validée de cs.wisc.edu
Boaz BarakHarvard UniversityAdresse e-mail validée de boazbarak.org
Zhiyuan LiGraduate Student, Princeton UniversityAdresse e-mail validée de princeton.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonAdresse e-mail validée de princeton.edu
Yi Zhangpost-doc at Microsoft Research RedmondAdresse e-mail validée de microsoft.com
Ankur MoitraNorbert Wiener Professor of Mathematics, MITAdresse e-mail validée de mit.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityAdresse e-mail validée de cs.harvard.edu
Satyen KaleStaff Research Scientist, Google ResearchAdresse e-mail validée de google.com
Andrej RisteskiCarnegie Mellon UniversityAdresse e-mail validée de andrew.cmu.edu
Wei HuUniversity of California, BerkeleyAdresse e-mail validée de berkeley.edu
Simon Shaolei DuAssistant Professor, School of Computer Science and Engineering, University of WashingtonAdresse e-mail validée de cs.washington.edu
Mario SzegedyProfessor of Computer Science, Rutgers UniversityAdresse e-mail validée de cs.rutgers.edu
Satish B RaoAdresse e-mail validée de berkeley.edu
Nikunj SaunshiPrinceton UniversityAdresse e-mail validée de princeton.edu
Ruosong WangPhD Student, Carnegie Mellon UniversityAdresse e-mail validée de andrew.cmu.edu
Mikhail KhodakCMUAdresse e-mail validée de cs.princeton.edu
David SteurerETH ZürichAdresse e-mail validée de inf.ethz.ch
Nadav CohenAsst. Professor of Computer Science, Tel Aviv UniversityAdresse e-mail validée de cs.tau.ac.il

Suivre

Sanjeev Arora

Professor of Computer Science, Princeton University

Adresse e-mail validée de cs.princeton.edu - Page d'accueil

theoretical machine learning theoretical computer science


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Computational complexity: a modern approach S Arora, B Barak Cambridge University Press, 2009	3892	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	2882	1998
Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998	1675	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	1331	1998
A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma International conference on learning representations, 2017	1204	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	937	2012
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	924	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	617	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	575	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	573	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	554	1996
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	543	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	542	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	512	1998
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	475	2018
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	472	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	471	2013
Computing a nonnegative matrix factorization---provably S Arora, R Ge, R Kannan, A Moitra SIAM Journal on Computing 45 (4), 1582-1611, 2016	453	2016
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	391	2014

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs