Faster and Simpler Algorithms for Robust Statistics

Mathematical Conversations
Topic:Faster and Simpler Algorithms for Robust Statistics
Speaker:Yu Cheng
Affiliation:University of Illinois at Chicago; Visitor, School of Mathematics
Date:Wednesday, December 18
Time/Room:6:00pm - 7:30pm/Dilworth Room

In this talk, we will discuss some of the recent advances in high-dimensional robust statistics. In particular, we will focus on designing faster and simpler robust algorithms for fundamental statistical and machine learning problems.