## STA/BST 290 Seminar: Sivaram Balakrishnan

### STA / BST 290 Seminar Series

Thursday, January 22, 4:10pm, MSB 1147 (Colloquium Room)

Refreshments at 3:30pm in MSB 4110 (Statistics Lounge)

Speaker: **Sivaram Balakrishnan** (University of California, Berkeley)

Title: **Statistical and Computational Guarantees for the EM Algorithm**

Abstract: The expectation-maximization (EM) algorithm is an iterative method for finding maximum-likelihood estimates of parameters in statistical models with unobserved latent variables. Along with Markov Chain Monte Carlo (MCMC) it is one of the two computational workhorses that provided much impetus for statistics in entering its modern computation-intensive phase. Much is known about the EM algorithm, its convergence properties, and its susceptibility to local optima. However, despite the existence of multiple fixed points, on a variety of statistical problems the EM algorithm has been observed empirically to perform well given either a reasonable initialization or with several random starts.

In this talk, I will introduce novel techniques to theoretically characterize some of the empirically observed behavior of the EM algorithm and give conditions under which the EM algorithm converges to near globally optimal parameter estimates. In particular, I will show the surprising result that for several canonical latent variable models there are large regions of the parameter space over which every fixed point of the EM algorithm is close to a population global optimum. I will conclude with a discussion of some of my other research interests, presenting a few vignettes from my work on clustering and topological data analysis.

Bio: Sivaraman Balakrishnan is a postdoctoral researcher in the Department of Statistics at the University of California at Berkeley, working with Martin J. Wainwright and Bin Yu. Prior to this he received his Ph.D. from the School of Computer Science at Carnegie Mellon University in 2013. His Ph.D. work was supported by several fellowships including the Richard King Mellon Fellowship and a grant from the Gates Foundation. He is broadly interested in problems that lie at the interface between computer science and statistics. Some particular areas that have provided motivation for his past and current research include the applications of statistical methods in computational biology, clustering, topological data analysis and non-parametric statistics.