Global Convergence of EM Algorithm for Mixtures of Two Component Linear Regression
Abstract
The Expectation-Maximization algorithm is perhaps the most broadly used algorithm for inference of latent variable problems. A theoretical understanding of its performance, however, largely remains lacking. Recent results established that EM enjoys global convergence for Gaussian Mixture Models. For Mixed Linear Regression, however, only local convergence results have been established, and those only for the high SNR regime. We show here that EM converges for mixed linear regression with two components (it is known that it may fail to converge for three or more), and moreover that this convergence holds for random initialization. Our analysis reveals that EM exhibits very different behavior in Mixed Linear Regression from its behavior in Gaussian Mixture Models, and hence our proofs require the development of several new ideas.
Cite
@article{arxiv.1810.05752,
title = {Global Convergence of EM Algorithm for Mixtures of Two Component Linear Regression},
author = {Jeongyeol Kwon and Wei Qian and Constantine Caramanis and Yudong Chen and Damek Davis},
journal= {arXiv preprint arXiv:1810.05752},
year = {2019}
}
Comments
To appear in the proceedings of the Conference on Learning Theory (COLT), 2019. This paper results from a merger of work from two groups who work on the problem at the same time