Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Ankur Moitra

Spoofing Generalization: When Can't You Trust Proprietary Models?


Jun 15, 2021
Ankur Moitra, Elchanan Mossel, Colin Sandon


  Access Paper or Ask Questions

Sparsification for Sums of Exponentials and its Algorithmic Applications


Jun 05, 2021
Jerry Li, Allen Liu, Ankur Moitra


  Access Paper or Ask Questions

How to Decompose a Tensor with Group Structure


Jun 04, 2021
Allen Liu, Ankur Moitra


  Access Paper or Ask Questions

Learning GMMs with Nearly Optimal Robustness Guarantees


Apr 19, 2021
Allen Liu, Ankur Moitra


  Access Paper or Ask Questions

No-go Theorem for Acceleration in the Hyperbolic Plane


Jan 17, 2021
Linus Hamilton, Ankur Moitra

* 12 pages 

  Access Paper or Ask Questions

Learning to Sample from Censored Markov Random Fields


Jan 15, 2021
Ankur Moitra, Elchanan Mossel, Colin Sandon


  Access Paper or Ask Questions

Settling the Robust Learnability of Mixtures of Gaussians


Nov 06, 2020
Allen Liu, Ankur Moitra


  Access Paper or Ask Questions

Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination


Oct 08, 2020
Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau

* 37 pages, 1 figure 

  Access Paper or Ask Questions

Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Connections to Evolvability


Jun 08, 2020
Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau

* 51 pages, comments welcome 

  Access Paper or Ask Questions

Tensor Completion Made Practical


Jun 04, 2020
Allen Liu, Ankur Moitra


  Access Paper or Ask Questions

Learning Structured Distributions From Untrusted Batches: Faster and Simpler


Feb 24, 2020
Sitan Chen, Jerry Li, Ankur Moitra

* 34 pages 

  Access Paper or Ask Questions

Fast Convergence for Langevin Diffusion with Matrix Manifold Structure


Feb 13, 2020
Ankur Moitra, Andrej Risteski

* 52 pages 

  Access Paper or Ask Questions

Polynomial time guarantees for the Burer-Monteiro method


Dec 03, 2019
Diego Cifuentes, Ankur Moitra

* 25 pages, 2 figures 

  Access Paper or Ask Questions

Efficiently Learning Structured Distributions from Untrusted Batches


Nov 05, 2019
Sitan Chen, Jerry Li, Ankur Moitra

* 46 pages 

  Access Paper or Ask Questions

Learning Some Popular Gaussian Graphical Models without Condition Number Bounds


May 03, 2019
Jonathan Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra


  Access Paper or Ask Questions

Learning Restricted Boltzmann Machines via Influence Maximization


Nov 05, 2018
Guy Bresler, Frederic Koehler, Ankur Moitra, Elchanan Mossel

* 29 pages 

  Access Paper or Ask Questions

Spectral Methods from Tensor Networks


Nov 02, 2018
Ankur Moitra, Alexander S. Wein

* 30 pages, 8 figures 

  Access Paper or Ask Questions

Efficiently Learning Mixtures of Mallows Models


Aug 17, 2018
Allen Liu, Ankur Moitra

* FOCS 2018 
* 35 pages 

  Access Paper or Ask Questions

Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models


Jul 13, 2018
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra

* Ann. Statist., Volume 46, Number 5 (2018), 2416-2451 
* 67 pages, 3 figures. This is the journal version of part I of arXiv:1609.05573, accepted to the Annals of Statistics. This version includes the supplementary material as appendices 

  Access Paper or Ask Questions

Learning Mixtures of Product Distributions via Higher Multilinear Moments


Mar 17, 2018
Sitan Chen, Ankur Moitra

* 57 pages, comments welcome 

  Access Paper or Ask Questions

Being Robust (in High Dimensions) Can Be Practical


Mar 13, 2018
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart

* Appeared in ICML 2017 

  Access Paper or Ask Questions

Robustly Learning a Gaussian: Getting Optimal Error, Efficiently


Nov 05, 2017
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, Alistair Stewart

* To appear in SODA 2018 

  Access Paper or Ask Questions

Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications


May 31, 2017
Linus Hamilton, Frederic Koehler, Ankur Moitra

* 25 pages 

  Access Paper or Ask Questions

Approximate Counting, the Lovasz Local Lemma and Inference in Graphical Models


Mar 16, 2017
Ankur Moitra

* 25 pages, 2 figures 

  Access Paper or Ask Questions

Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization


Dec 23, 2016
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra

* 58 pages, 5 figures. This version adds improved results for the Wishart model 

  Access Paper or Ask Questions

Message-passing algorithms for synchronization problems over compact groups


Oct 14, 2016
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra

* 35 pages, 11 figures 

  Access Paper or Ask Questions

Provable Algorithms for Inference in Topic Models


May 27, 2016
Sanjeev Arora, Rong Ge, Frederic Koehler, Tengyu Ma, Ankur Moitra

* to appear at ICML'2016 

  Access Paper or Ask Questions

Robust Estimators in High Dimensions without the Computational Intractability


Apr 21, 2016
Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, Alistair Stewart


  Access Paper or Ask Questions

How Robust are Reconstruction Thresholds for Community Detection?


Mar 21, 2016
Ankur Moitra, William Perry, Alexander S. Wein

* 36 pages, 3 figures 

  Access Paper or Ask Questions

Noisy Tensor Completion via the Sum-of-Squares Hierarchy


Feb 18, 2016
Boaz Barak, Ankur Moitra

* 24 pages 

  Access Paper or Ask Questions