English

EM Converges for a Mixture of Many Linear Regressions

Machine Learning 2019-11-27 v2 Machine Learning

Abstract

We study the convergence of the Expectation-Maximization (EM) algorithm for mixtures of linear regressions with an arbitrary number kk of components. We show that as long as signal-to-noise ratio (SNR) is Ω~(k)\tilde{\Omega}(k), well-initialized EM converges to the true regression parameters. Previous results for k3k \geq 3 have only established local convergence for the noiseless setting, i.e., where SNR is infinitely large. Our results enlarge the scope to the environment with noises, and notably, we establish a statistical error rate that is independent of the norm (or pairwise distance) of the regression parameters. In particular, our results imply exact recovery as σ0\sigma \rightarrow 0, in contrast to most previous local convergence results for EM, where the statistical error scaled with the norm of parameters. Standard moment-method approaches may be applied to guarantee we are in the region where our local convergence guarantees apply.

Keywords

Cite

@article{arxiv.1905.12106,
  title  = {EM Converges for a Mixture of Many Linear Regressions},
  author = {Jeongyeol Kwon and Constantine Caramanis},
  journal= {arXiv preprint arXiv:1905.12106},
  year   = {2019}
}

Comments

SNR, initialization conditions improved from previous version