1![Mathematics of Machine Learning: An introduction Sanjeev Arora Princeton University Computer Science Institute for Advanced Study Mathematics of Machine Learning: An introduction Sanjeev Arora Princeton University Computer Science Institute for Advanced Study](https://www.pdfsearch.io/img/1f8c6dbda12db241bb5f75261b492050.jpg) | Add to Reading ListSource URL: eta.impa.brLanguage: English - Date: 2018-07-28 17:09:48
|
---|
2![The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS) The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS)](https://www.pdfsearch.io/img/65922f0344aee61016e492badbeb61fe.jpg) | Add to Reading ListSource URL: eatcs.orgLanguage: English - Date: 2016-09-14 05:18:24
|
---|
3![Generalization and Equilibrium in Generative Adversarial Nets (GANs) Sanjeev Arora 1 Rong Ge 2 Yingyu Liang 1 Tengyu Ma 1 Yi Zhang 1 Abstract It is shown that training of generative adversarial network (GAN) may not have Generalization and Equilibrium in Generative Adversarial Nets (GANs) Sanjeev Arora 1 Rong Ge 2 Yingyu Liang 1 Tengyu Ma 1 Yi Zhang 1 Abstract It is shown that training of generative adversarial network (GAN) may not have](https://www.pdfsearch.io/img/533c06bf062f14bb1a837737948941b5.jpg) | Add to Reading ListSource URL: proceedings.mlr.press- Date: 2018-02-06 15:06:57
|
---|
4![Generalization and Equilibrium in Generative Adversarial Nets (GANs) Sanjeev Arora∗ Rong Ge Generalization and Equilibrium in Generative Adversarial Nets (GANs) Sanjeev Arora∗ Rong Ge](https://www.pdfsearch.io/img/7d2a31414ccc32a07c5fde97e1f96666.jpg) | Add to Reading ListSource URL: proceedings.mlr.press- Date: 2018-02-06 15:06:57
|
---|
5![princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 7: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 7: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora](https://www.pdfsearch.io/img/cc0108f845c1b0322cb6c2e91c4b4b4a.jpg) | Add to Reading ListSource URL: www.cs.princeton.edu- Date: 2014-10-14 20:29:59
|
---|
6![princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 1: Course Intro and Hashing Lecturer: Sanjeev Arora princeton univ. F’14 cos 521: Advanced Algorithm Design Lecture 1: Course Intro and Hashing Lecturer: Sanjeev Arora](https://www.pdfsearch.io/img/ffcad8188df7daba0df79679efd96f3b.jpg) | Add to Reading ListSource URL: www.cs.princeton.edu- Date: 2014-09-17 11:30:55
|
---|
7![A Combinatorial, Primal-Dual approach to Semidefinite Programs Sanjeev Arora∗ Satyen Kale∗ Computer Science Department, Princeton University 35 Olden Street, Princeton, NJ 08540 {arora, satyen}@cs.princeton.edu A Combinatorial, Primal-Dual approach to Semidefinite Programs Sanjeev Arora∗ Satyen Kale∗ Computer Science Department, Princeton University 35 Olden Street, Princeton, NJ 08540 {arora, satyen}@cs.princeton.edu](https://www.pdfsearch.io/img/92e2d2ff69984774218fca4f92820baa.jpg) | Add to Reading ListSource URL: www.cs.princeton.edu- Date: 2010-05-19 22:10:59
|
---|
8![](/pdf-icon.png) | Add to Reading ListSource URL: echo.unm.edu- Date: 2016-01-09 22:23:34
|
---|
9![Computational Complexity and Information Asymmetry in Financial Products (Working paper) Sanjeev Arora∗ Computational Complexity and Information Asymmetry in Financial Products (Working paper) Sanjeev Arora∗](https://www.pdfsearch.io/img/25ed87b2ee5935af7ba53335f75c651a.jpg) | Add to Reading ListSource URL: users.cs.duke.edu- Date: 2012-02-05 15:27:31
|
---|
10![Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Abstract Page Replacement for General Caching Problems Susanne Albers Sanjeev Arora y Abstract](https://www.pdfsearch.io/img/637ba3c8bab7267cd1dd93b420d88054.jpg) | Add to Reading ListSource URL: www14.in.tum.de- Date: 2013-11-25 11:05:19
|
---|