Sanjeev Arora

Citata da

	Tutte	Dal 2016
Citazioni	24279	11034
Indice H	64	44
i10-index	112	90

3100

1550

775

2325

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202166 136 141 179 225 335 303 311 294 325 373 396 527 586 624 565 729 791 894 1072 1152 1367 1302 1533 1618 1970 2518 3034 327

Coautori

Rong GeDuke UniversityEmail verificata su cs.duke.edu
Boaz BarakHarvard UniversityEmail verificata su boazbarak.org
Elad HazanProfessor at Princeton University and Director Google AI PrincetonEmail verificata su cs.princeton.edu
Yingyu LiangUniversity of Wisconsin-MadisonEmail verificata su cs.wisc.edu
Ankur MoitraAssociate Professor of Applied Mathematics, MITEmail verificata su mit.edu
Satyen KaleStaff Research Scientist, Google ResearchEmail verificata su google.com
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityEmail verificata su cs.harvard.edu
Andrej RisteskiCarnegie Mellon UniversityEmail verificata su andrew.cmu.edu
Zhiyuan LiGraduate Student, Princeton UniversityEmail verificata su princeton.edu
Satish B RaoEmail verificata su berkeley.edu
Wei HuPrinceton UniversityEmail verificata su princeton.edu
Tengyu MAStanford UniversityEmail verificata su stanford.edu
David SteurerETH ZürichEmail verificata su inf.ethz.ch
KANNAN REmail verificata su bitsathy.ac.in
Simon Shaolei DuAssistant Professor, School of Computer Science and Engineering, University of WashingtonEmail verificata su cs.washington.edu
Ruosong WangCarnegie Mellon UniversityEmail verificata su andrew.cmu.edu
Aditya BhaskaraUniversity of UtahEmail verificata su cs.utah.edu
George KarakostasAssociate Professor of Computing & Software, McMaster UniversityEmail verificata su mcmaster.ca
David MimnoAssociate Professor, Cornell UniversityEmail verificata su cornell.edu
Yoni HalpernGoogleEmail verificata su google.com

Sanjeev Arora

Professor of Computer Science, Princeton University

Email verificata su cs.princeton.edu - Home page

theoretical machine learning theoretical computer science


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Computational complexity: a modern approach S Arora, B Barak Cambridge University Press, 2009	3189	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	2708	1998
Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998	1551	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	1219	1998
Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009	863	2009
A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma	816	2016
The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of Computing 8 (1), 121-164, 2012	769	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	552*	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	510	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	504	1999
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	474	1998
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	428	2017
Hardness of approximations S Arora, C Lund Approximation algorithms for NP-hard problems, 399-446, 1996	416	1996
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	413	2012
Computing a nonnegative matrix factorization---Provably S Arora, R Ge, R Kannan, A Moitra SIAM Journal on Computing 45 (4), 1582-1611, 2016	405	2016
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	397	2013
Provable bounds for learning some deep representations S Arora, A Bhaskara, R Ge, T Ma International conference on machine learning, 584-592, 2014	342	2014
Improved low-degree testing and its applications S Arora, M Sudan Combinatorica 23 (3), 365-426, 2003	337	2003
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	308	2019
Measurement of the rapidity and transverse momentum distributions of bosons in collisions at S Chatrchyan, V Khachatryan, AM Sirunyan, A Tumasyan, W Adam, ... Physical Review D 85 (3), 032002, 2012	297	2012

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori