SINGULARITY, MISSPECIFICATION AND THE CONVERGENCE RATE OF EM
SINGULARITY, MISSPECIFICATION AND THE CONVERGENCE RATE OF EM
复制标题
DOI:
10.1214/19-aos1924
复制
发表时间:
2020-12-01
影响因子:
4.5
通讯作者:
Yu, Bin
中科院分区:
文献类型:
--
作者:
Dwivedi, Raaz;Nhat Ho;Yu, Bin
A line of recent work has analyzed the behavior of the Expectation-Maximization (EM) algorithm in the well-specified setting, in which the population likelihood is locally strongly concave around its maximizing argument. Examples include suitably separated Gaussian mixture models and mixtures of linear regressions. We consider over-specified settings in which the number of fitted components is larger than the number of components in the true distribution. Such mis-specified settings can lead to singularity in the Fisher information matrix, and moreover, the maximum likelihood estimator based on n i.i.d. samples in d dimensions can have a nonstandard O((d/n)(1/4)) rate of convergence. Focusing on the simple setting of two-component mixtures fit to a d-dimensional Gaussian distribution, we study the behavior of the EM algorithm both when the mixture weights are different (unbalanced case), and are equal (balanced case). Our analysis reveals a sharp distinction between these two cases: in the former, the EM algorithm converges geomet- rically to a point at Euclidean distance of O((d/n)(1/2)) from the true parameter, whereas in the latter case, the convergence rate is exponentially slower, and the fixed point has a much lower O((d/n)(1/4)) accuracy. Analysis of this singular case requires the introduction of some novel techniques: in particular, we make use of a careful form of localization in the associated empirical process, and develop a recursive argument to progressively sharpen the statistical rate.