On the rate of convergence of the ECME algorithm for multiple regression models with t-distributed errors
具有 t 分布误差的多元回归模型中 ECME 算法的收敛速度AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦通用回归模型的优化算法,未明确涉及所列经济领域细分。
具有 t 分布误差的多元回归模型中 ECME 算法的收敛速度AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Although much work has been done on comparing and contrasting the EM and ECME algorithms, in terms of their rates of convergence, it is not clear what mechanism underlies each and, furthermore, what factors may determine and influence their rates of convergence. In this paper, we examine the convergence rates and properties of these two popular optimisation algorithms as used in computing the maximum likelihood estimates from regression models with t-distributed errors. By approaching this computing problem through the use of two data augmentation schemes, as well as variations of these well-known algorithms, we offer a more composite view on the performance of each.