arrow
返回

STATISTICAL GUARANTEES FOR THE EM ALGORITHM: FROM POPULATION TO SAMPLE-BASED ANALYSIS

delete2017-02-01
delete291
delete
OA
AI
S
Sivaraman Balakrishnan *
M
Martin J. Wainwright
B
Bin Yu
DOI:10.1214/16-AOS1435delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The EM algorithm is a widely used tool in maximum-likelihood estimation in incomplete data problems. Existing theoretical work has focused on conditions under which the iterates or likelihood values converge, and the associated rates of convergence. Such guarantees do not distinguish whether the ultimate fixed point is a near global optimum or a bad local optimum of the sample likelihood, nor do they relate the obtained fixed point to the global optima of the idealized population likelihood (obtained in the limit of infinite data). This paper develops a theoretical framework for quantifying when and how quickly EM-type iterates converge to a small neighborhood of a given global optimum of the population likelihood. For correctly specified models, such a characterization yields rigorous guarantees on the performance of certain two-stage estimators in which a suitable initial pilot estimator is refined with iterations of the EM algorithm. Our analysis is divided into two parts: a treatment of the EM and first-order EM algorithms at the population level, followed by results that apply to these algorithms on a finite set of samples. Our conditions allow for a characterization of the region of convergence of EM-type iterates to a given population fixed point, that is, the region of the parameter space over which convergence is guaranteed to a point within a small neighborhood of the specified population fixed point. We verify our conditions and give tight characterizations of the region of convergence for three canonical problems of interest: symmetric mixture of two Gaussians, symmetric mixture of two regressions and linear regression with covariates missing completely at random.
Keyword:
EM algorithm
first-order EM algorithm
nonconvex optimization
maximum likelihood estimation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Annals of Statistics 封面图
Annals of Statistics
IF:
3.7
论文数:
2.8K
被引数:
2.9W

机构

University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
引用论文

引用论文

Dendritic-cell vaccines on the move
err2015-03-11
err0
errOAAI
errRachel Lubong Sabado; Nina Bhardwaj
err分享
err收藏
Schnelle Erkennung einer depressiven Störung bei Menschen mit Epilepsie
err2014-01-26
err0
PREAI
errC. Brandt; K. Labudda; D. Illies; M. Schöndienst; T.W. May
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Alkaline earth copper oxides
err1991-04-01
err0
PREAI
errD.R. Lines; M.T. Weller; D.B. Currie; D.M. Ogbome
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Hormone replacement therapy
err1992-12-01
err0
PREAI
errLila E. Nachtigall; Margaret J. Nachtigall
err分享
err收藏
学者 查看更多内容