Browsing by Author Ge, R
Showing results 1 to 11 of 11
| Publication Date | Article Title | Author(s) |
| 2016 | Computing a nonnegative matrix factorization-provably | Arora, Sanjeev; Ge, R; Kannan, R; Moitra, A |
| 2012 | Finding overlapping communities in social networks: Toward a rigorous approach | Arora, Sanjeev; Ge, R; Sachdeva, S; Schoenebeck, G |
| 2017 | Generalization and equilibrium in generative adversarial nets (GANs) | Arora, Sanjeev; Ge, R; Liang, Y; Ma, T; Zhang, Y |
| 2012 | Learning topic models - Going beyond SVD | Arora, Sanjeev; Ge, R; Moitra, A |
| 2014 | New algorithms for learning incoherent and overcomplete dictionaries | Arora, Sanjeev; Ge, R; Moitra, A |
| 2016 | Provable algorithms for inference in topic models | Arora, Sanjeev; Ge, R; Koehler, F; Ma, T; Moitra, A |
| 2014 | Provable bounds for learning some deep representations | Arora, Sanjeev; Bhaskara, A; Ge, R; Ma, T |
| 2017 | Provable learning of noisy-or networks | Arora, Sanjeev; Ge, R; Ma, T; Risteski, A |
| 2015 | Simple, efficient, and neural algorithms for sparse coding | Arora, Sanjeev; Ge, R; Ma, T; Moitra, A |
| 2018 | Stronger generalization bounds for deep nets via a compression approach | Arora, Sanjeev; Ge, R; Neyshabur, B; Zhang, Y |
| 2013 | Towards a better approximation for SPARSEST CUT? | Arora, Sanjeev; Ge, R; Sinop, AK |
