頁籤選單縮合
| 題 名 | Nesting EM Algorithms for Computational Efficiency |
|---|---|
| 作 者 | van Dyk,David A.; | 書刊名 | Statistica Sinica |
| 卷 期 | 10:1 2000.01[民89.01] |
| 頁 次 | 頁203-225 |
| 分類號 | 319.5 |
| 關鍵詞 | 譜系模; 計算效率; Bridge sampling; Efficient data augmentation; Gibbs sampler; GLMM; Hierarchical models; Importance sampling; MCEM algorithm; MCMC; Probit models; t-models; Working parameters; |
| 語 文 | 英文(English) |
| 英文摘要 | Computing posterior modes (e.g., maximum likelihood estimates) for models involving latent variables or missing data often involves complicated optimization procedures. By splitting this task into two simpler parts, however, EM-type algorithms often offer a simple solution. Although this approach has proven useful, in some settings even these simpler tasks are challenging. In particular, computations involving latent variables are typically difficult to simplify. Thus, in models such as hierarchical models with complicated latent variable structures, computationally intensive methods may be required for the expectation step of EM. This paper describes how nesting two or more EM algorithms can take advantage of closed form conditional expectations and lead to algorithms which converge faster, are straightforward to implement, and enjoy stable convergence properties. Methodology to monitor convergence of nested EM algorithms is developed using importance and bridge sampling. The strategy is applied to hierarchical probit and t regression models to derive algorithms which incorporate aspects of Monte-Carlo EM, PX-EM, and nesting in order to combine computational efficiency with easy implementation. |
本系統中英文摘要資訊取自各篇刊載內容。