pith. sign in

arxiv: 1810.05752 · v4 · pith:HTX36EKQnew · submitted 2018-10-12 · 📊 stat.ML · cs.LG· math.ST· stat.TH

Global Convergence of EM Algorithm for Mixtures of Two Component Linear Regression

classification 📊 stat.ML cs.LGmath.STstat.TH
keywords convergencelinearregressionalgorithmmixedbehaviorestablishedgaussian
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Expectation Maximization (EM) Converges for General Agnostic Mixtures

    cs.LG 2026-04 conditional novelty 7.0

    Gradient EM converges exponentially to optimal population loss minimizers for agnostic fitting of k parametric functions under strong convexity and smoothness of the loss, proper initialization, and separation conditions.