Ankur Moitra
Ankur Moitra
Associate Professor of Applied Mathematics, MIT
Verified email at mit.edu
TitleCited byYear
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
3102012
Computing a nonnegative matrix factorization--provably
S Arora, R Ge, R Kannan, A Moitra
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
2952012
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
2932013
Settling the polynomial learnability of mixtures of gaussians
A Moitra, G Valiant
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 93-102, 2010
2202010
New algorithms for learning incoherent and overcomplete dictionaries
S Arora, R Ge, A Moitra
Conference on Learning Theory, 779-806, 2014
1552014
Simple, efficient, and neural algorithms for sparse coding
S Arora, R Ge, T Ma, A Moitra
Proceedings of Machine Learning Research, 2015
1312015
Efficiently learning mixtures of two Gaussians
AT Kalai, A Moitra, G Valiant
Proceedings of the forty-second ACM symposium on Theory of computing, 553-562, 2010
1312010
Some results on greedy embeddings in metric spaces
T Leighton, A Moitra
Discrete & Computational Geometry 44 (3), 686-705, 2010
1212010
Robust Estimators in High-Dimensions Without the Computational Intractability
I Diakonikolas, G Kamath, D Kane, J Li, A Moitra, A Stewart
SIAM Journal on Computing 48 (2), 742-864, 2019
1032019
Smoothed analysis of tensor decompositions
A Bhaskara, M Charikar, A Moitra, A Vijayaraghavan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
882014
An information complexity approach to extended formulations
M Braverman, A Moitra
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
772013
A nearly tight sum-of-squares lower bound for the planted clique problem
B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin
SIAM Journal on Computing 48 (2), 687-735, 2019
692019
Provable ICA with unknown Gaussian noise, with implications for Gaussian mixtures and autoencoders
S Arora, R Ge, A Moitra, S Sachdeva
Advances in Neural Information Processing Systems, 2375-2383, 2012
692012
Algorithms and hardness for robust subspace recovery
M Hardt, A Moitra
Conference on Learning Theory, 354-375, 2013
672013
Super-resolution, extremal functions and the condition number of Vandermonde matrices
A Moitra
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
642015
Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size
A Moitra
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 3-12, 2009
562009
An almost optimal algorithm for computing nonnegative rank
A Moitra
SIAM Journal on Computing 45 (1), 156-173, 2016
55*2016
Disentangling gaussians
AT Kalai, A Moitra, G Valiant
Communications of the ACM 55, 2016
542016
Efficient and explicit coding for interactive communication
R Gelles, A Moitra, A Sahai
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 768-777, 2011
542011
Noisy tensor completion via the sum-of-squares hierarchy
B Barak, A Moitra
Conference on Learning Theory, 417-445, 2016
532016
The system can't perform the operation now. Try again later.
Articles 1–20