IST Lunch Bunch

Tuesday October 30, 2012 12:00 PM

Computational and Sample Tradeoffs via Convex Relaxation

Speaker: Venkat Chandrasekaran, Computing & Mathematical Sciences, Caltech
Location: Annenberg 105
In modern data analysis, one is frequently faced with statistical inference problems involving massive datasets. Processing such large datasets is usually viewed as a substantial computational challenge. However, if data are a statistician's main resource then access to more data should be viewed as an asset rather than as a burden. In this talk we discuss a computational framework based on convex relaxation to reduce the computational complexity of an inference procedure when one has access to increasingly larger datasets. Essentially, the statistical gains from larger datasets can be exploited to reduce the runtime of inference algorithms. (Joint work with Michael Jordan.)
Series IST Lunch Bunch

Contact: Sydney Garstang at 626-395-4555 sydney@caltech.edu