Browsing by Author Moitra, Ankur
Showing results 1 to 8 of 8
| Publication Date | Article Title | Author(s) |
|---|---|---|
| 2012 | Computing a nonnegative matrix factorization -- provably | Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur |
| Jun-2013 | An information complexity approach to extended formulations | Braverman, Mark; Moitra, Ankur |
| 2018 | Learning topic models -- provably and efficiently | Arora, Sanjeev; Ge, Rong; Halpern, Yoni; Mimno, David; Moitra, Ankur; et al |
| 2014 | Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? | Bhaskara, Aditya; Charikar, Moses; Moitra, Ankur; Vijayaraghavan, Aravindan |
| 2013 | A Practical Algorithm for Topic Modeling with Provable Guarantees | Arora, Sanjeev; Ge, Rong; Halpern, Yonatan; Mimno, David; Moitra, Ankur; et al |
| 2015 | Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders | Arora, Sanjeev; Ge, Rong; Moitra, Ankur; Sachdeva, Sushant |
| 2012 | Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders | Arora, Sanjeev; Ge, Rong; Moitra, Ankur; Sachdeva, Sushant |
| May-2014 | Smoothed analysis of tensor decompositions | Bhaskara, Aditya; Charikar, Moses; Moitra, Ankur; Vijayaraghavan, Aravindan |