The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
ECME 算法：具有更快单调收敛的 EM 与 ECM 扩展AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要提出通用似然优化算法，未限定结构估计、离散选择或其他所列模型，缺乏直接的细分领域依据。
反馈分类问题正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
ECME 算法：具有更快单调收敛的 EM 与 ECM 扩展
- 研究问题
- 如何在保留 EM 与 ECM 实现简洁和单调收敛特点的同时，减少迭代次数或实际计算时间？
- 方法与思路
- 作者用约束下实际似然的最大化步骤替换部分 ECM 条件最大化步骤，并在合适的子问题中使用更快的数值方法。
- 材料陈述的贡献
- 摘要称，ECME 可显著加快收敛，给出闭式与迭代步骤示例及收敛率理论表达，并讨论与马尔可夫链蒙特卡洛的关系。
- 阅读关注点
- 应核对步骤替换如何保证单调性、收敛率表达的条件，以及迭代次数与计算时间比较使用的模型和停止准则。
- 阅读边界
- 仅据 OpenAlex 索引摘要，稿件版本未注明；加速幅度与适用条件未给出，单调收敛也不能直接解释为达到全局最大值。
原文摘要
A generalisation of the ecm algorithm (Meng & Rubin, 1993), which is itself an extension of the em algorithm (Dempster, Laird & Rubin, 1977), can be obtained by replacing some CM-steps of ECM, which maximise the constrained expected complete-data loglikelihood function, with steps that maximise the correspondingly constrained actual likelihood function. This algorithm, which we call ecme algorithm, for Expectation/Conditional Maximisation Either, shares with both em and ecm their stable monotone convergence and basic simplicity of implementation relative to competing faster converging methods. Moreover, ecme can have a substantially faster convergence rate than either EM or ECM, measured using either the number of iterations or actual computer time. There are two reasons for this improvement. First, in some of ECME'S maximisation steps, the actual likelihood is being conditionally maximised, rather than a current approximation to it, as with EM and ECM. Secondly, ecme allows faster converging numerical methods to be used on only those constrained maximisations where they are most efficacious. Illustrative ecme algorithms are presented with both closed-form and iterative CM-steps, which demonstrate the faster rate of convergence and the associated easier assessment of convergence. Also, theoretical expressions are presented and illustrated regarding the rate of convergence of ecme. Finally, relationships with Markov chain Monte Carlo methods are discussed.