ARC Colloquium: Ankur Moitra (MIT)

Primary tabs

Video of this talk is available at: https://smartech.gatech.edu/handle/1853/56016

Full collection of talk videos are available at: https://smartech.gatech.edu/handle/1853/46836

Algorithms & Randomness Center (ARC)

Ankur Moitra - MIT

Monday, October 31, 2016

Klaus 1116 West – 11:00 am

Robust Statistics, Revisited

Starting from the seminal works of Tukey (1960) and Huber (1962), the field of robust statistics asks: Are there estimators that provable work in the presence of noise? The trouble is that all known provably robust estimators are also hard to compute in high-dimensions.

Here, we study a basic problem in robust statistics, posed in various forms in the above works. Given corrupted samples from a high-dimensional Gaussian, are there efficient algorithms to accurately estimate its parameters? We give the first algorithms that are able to tolerate a constant fraction of corruptions that is independent of the dimension. Additionally, we give several more applications of our techniques to product distributions and various mixture models.

This is based on joint work with Ilias Diakonikolas, Jerry Li, Gautam Kamath, Daniel Kane and Alistair Stewart.

Ankur Moitra is the Rockwell International Assistant Professor in the Department of Mathematics at MIT and a Principal Investigator in the Computer Science and Artificial Intelligence Lab (CSAIL). The aim of his work is to bridge the gap between theoretical computer science and machine learning by developing algorithms with provable guarantees and foundations for reasoning about their behavior. He is a recipient of a Packard Fellowship, a Sloan Fellowship, an NSF CAREER Award, an NSF Computing and Innovation Fellowship and a Hertz Fellowship.



  • Workflow Status: Published
  • Created By: Dani Denton
  • Created: 08/08/2016
  • Modified By: Fletcher Moore
  • Modified: 04/13/2017

Target Audience

No target audience selected.