Ankur Moitra - Concepedia

Author

Ankur Moitra

Massachusetts Institute of Technology ORCID

Also Known As

Ankur Moitra, Bhargava, Vishwas, Moitra, Ankur

206

Publications

3.9K

Citations

H-Index

115

Concepts

All Affiliations

Massachusetts Institute of Technology Princeton University University of California, Berkeley Institute for Advanced Study Microsoft (United States)

About

Ankur Moitra is an author at Massachusetts Institute of Technology specializing in engineering, computer science, and data science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	27	46	2.8K
2	Arts	3	3	163
3	Education	3	3	75
4	Business	2	2	145
5	Language Studies	2	2	366

Ankur Moitra

Publications

3.4K

Citations

H-Index

Page 1

	Year	Citations
Learning Topic Models -- Going beyond SVD Sanjeev Arora, Rong Ge, Ankur Moitra EngineeringTopic ModelingCorpus LinguisticsText MiningWord Embeddings	2012	308
Computing a nonnegative matrix factorization -- provably Sanjeev Arora, Rong Ge, Ravindran Kannan, Mathematical ProgrammingEngineeringMachine LearningData ScienceMatrix Factorization	2012	285
Settling the Polynomial Learnability of Mixtures of Gaussians Ankur Moitra, Gregory Valiant Mathematical ProgrammingEngineeringMachine LearningMultivariate GaussiansMixture Parameters	2010	260
Efficiently learning mixtures of two Gaussians Adam Tauman Kalai, Ankur Moitra, Gregory Valiant Mixture DistributionImage AnalysisMachine LearningData ScienceMixture Parameters	2010	162
A Practical Algorithm for Topic Modeling with Provable Guarantees Sanjeev Arora, Rong Ge, Yoni Halpern, arXiv (Cornell University) Natural Language ProcessingProbabilistic OntologyLatent ModelingEngineeringData Science	2012	161
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices Ankur Moitra Spectral TheoryEngineeringExtremal FunctionsMatrix TheorySparse Imaging	2015	150
Smoothed analysis of tensor decompositions Aditya Bhaskara, Moses Charikar, Ankur Moitra, Sparse RepresentationEngineeringMachine LearningData ScienceTensor Decompositions	2014	116
An information complexity approach to extended formulations Mark Braverman, Ankur Moitra	2013	87
Simple, Efficient, and Neural Algorithms for Sparse Coding Sanjeev Arora, Rong Ge, Tengyu Ma, arXiv (Cornell University) Mathematical ProgrammingSparse CodingSparse RepresentationEngineeringMachine Learning	2015	84
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size Ankur Moitra Mathematical ProgrammingSteiner Cut ProblemBranch-and-bound AlgorithmEngineeringComputational Complexity	2009	79

Page 1