Sanjeev Arora

Cited by

	All	Since 2019
Citations	37052	18386
h-index	77	58
i10-index	144	116

3900

1950

975

2925

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024141 156 227 267 363 341 325 330 350 394 378 559 601 668 592 747 801 876 1036 1145 1334 1251 1438 1575 2000 2462 2951 3246 3653 3864 2199

Public access

View all

37 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
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
Nikunj SaunshiResearch Scientist, GoogleVerified email at google.com
Ankur MoitraNorbert Wiener Professor of Mathematics, MITVerified email at mit.edu
Satyen KaleResearch Scientist, Google ResearchVerified email at google.com
Wei HuAssistant Professor of Computer Science and Engineering, University of MichiganVerified email at umich.edu
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 WangPhD Student, Carnegie Mellon UniversityVerified email at andrew.cmu.edu
Satish B RaoVerified email at berkeley.edu
Mario SzegedyProfessor of Computer Science, Rutgers UniversityVerified email at cs.rutgers.edu
Nadav CohenAsst. Professor of Computer Science, Tel Aviv University | CTO & Co-Founder, ImubitVerified email at tauex.tau.ac.il
David SteurerETH ZürichVerified email at inf.ethz.ch
Zhao SongAdobe ResearchVerified email at ias.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
A 2 + ɛ approximation algorithm for the k-MST problem S Arora, G Karakostas Mathematical Programming 107 (3), 491-504, 2006	160	2006
A combinatorial, primal-dual approach to semidefinite programs S Arora, S Kale Journal of the ACM (JACM) 63 (2), 1-35, 2016	72	2016
A combinatorial, primal-dual approach to semidefinite programs S Arora, S Kale Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007	279	2007
A Combinatorial, Primal-Dual Approach to Semidefinite Programs S Kale, S Arora
A compressed sensing view of unsupervised text embeddings, bag-of-n-grams, and LSTMs S Arora, M Khodak, N Saunshi, K Vodrahalli International Conference on Learning Representations, 2018	47	2018
A convergence analysis of gradient descent for deep linear neural networks S Arora, N Cohen, N Golowich, W Hu ICLR 2019 and arXiv preprint arXiv:1810.02281, 2018	258	2018
A fast random sampling algorithm for sparsifying matrices S Arora, E Hazan, S Kale International Workshop on Approximation Algorithms for Combinatorial …, 2006	113	2006
A kernel-based view of language model fine-tuning S Malladi, A Wettig, D Yu, D Chen, S Arora ICML 2023, 23610-23641, 2023	42	2023
A la carte embedding: Cheap but effective induction of semantic feature vectors M Khodak, N Saunshi, Y Liang, T Ma, B Stewart, S Arora arXiv preprint arXiv:1805.05388, 2018	119	2018
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	581	2016
A mathematical exploration of why language models help solve downstream tasks N Saunshi, S Malladi, S Arora ICLR2021 and arXiv preprint arXiv:2010.03648, 2020	77	2020
A modern approach S Arora, B Barak Computational Complexity, 2009	3	2009
A new randomized procedure for the assingnment problem with applications to dense graph arrangement problems S Arora, A Frieze, H Kaplan Journal of Mathematical Programming 97 (1-2), 43-69, 2003	3	2003
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems S Arora, A Frieze, H Kaplan Mathematical programming 92, 1-36, 2002	115	2002
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems S Arora, A Frieze, H Kaplan Proceedings of 37th conference on foundations of computer science, 21-30, 1996	125	1996
A note on the Lovász theta number of random graphs S Arora, A Bhaskara
A note on the representational incompatibility of function approximation and factored dynamics E Allender, S Arora, M Kearns, C Moore, A Russell Advances in Neural Information Processing Systems 15, 2002	17	2002
A polynomial time algorithm to learn a mixture of general gaussians S Arora, R Kannan Proceedings of ACM Symposium on Theory of Computing, 2001	2	2001
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. S Arora, M Grigni, DR Karger, PN Klein, A Woloszyn SODA 98, 33-41, 1998	163	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	553	2013

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