| Computational complexity: a modern approach S Arora, B Barak Cambridge University Press, 2009 | 4845 | 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 | 3121 | 1998 |
| Probabilistic checking of proofs: A new characterization of NP S Arora, S Safra Journal of the ACM (JACM) 45 (1), 70-122, 1998 | 1842 | 1998 |
| A simple but tough-to-beat baseline for sentence embeddings S Arora, Y Liang, T Ma International conference on learning representations, 2017 | 1641 | 2017 |
| Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems S Arora Journal of the ACM (JACM) 45 (5), 753-782, 1998 | 1440 | 1998 |
| The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of computing 8 (1), 121-164, 2012 | 1228 | 2012 |
| Expander flows, geometric embeddings and graph partitioning S Arora, S Rao, U Vazirani Journal of the ACM (JACM) 56 (2), 1-37, 2009 | 1030 | 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 | 1001 | 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 | 947 | 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 | 789 | 2017 |
| 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 | 676 | 2018 |
| 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 | 616 | 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 | 604 | 1996 |
| 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 |
| 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 | 578 | 1995 |
| 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 |
| 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 | 538 | 2012 |
| 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 | 538 | 1998 |
| Implicit regularization in deep matrix factorization S Arora, N Cohen, W Hu, Y Luo Advances in Neural Information Processing Systems 32, 2019 | 521 | 2019 |
| On the optimization of deep networks: Implicit acceleration by overparameterization S Arora, N Cohen, E Hazan International conference on machine learning, 244-253, 2018 | 519 | 2018 |
Rong GeDuke University在 cs.duke.edu 的电子邮件经过验证
