期望最大化(EM)算法(Dempster,Laird and Rubin,1977)是一种用于计算缺失数据问题中的最大似然估计(MLE)的流行方法。算法的每次迭代形式上由E步和M步组成:E步:在给定观测数据的情况下评估预期的完整数据对数似然,期望值取当前参数估计值; M步:最大化所得表达式以找到更新的估计值。Boyles(1983)和Wu(1983)找到了保证EM序列收敛到唯一极大似然估计的条件。在高维数据的复杂模型中,在E步中经常会遇到一个棘手的积分。Wei和Tanner(1990)的Monte Carlo EM算法通过最大化适当条件期望的Monte Carlo近似值来解决这个困难。Monte Carlo EM的收敛性已经被Chan和Ledolter(1995)以及Fort和Moulines(2003)研究过。本文的目的是提供一个方便,但严格introduction的EM和Monte Carlo EM的收敛性能。假设没有EM算法的先前知识。我们演示了EM和Monte Carlo EM的实现在两个简单但现实的例子。我们表明,如果EM算法收敛,它收敛到一个稳定的点的可能性,和收敛速率是线性的最好的。对于Monte Carlo EM,我们给出了Chan和Ledolter(1995)的主要结果的可读证明,并在没有证明的情况下陈述了Fort和Moulines(2003)的结论。Fort和Moulines(2003)结果的一个重要实际意义涉及MCEM中Monte Carlo样本量的确定;我们简要回顾了关于该问题的文献(Booth和Hobert,1999; Caffo,Jank和Jones,2005)。
英文摘要:
The Expectation-Maximization (EM) algorithm (Dempster, Laird and Rubin, 1977) is a popular method for computing maximum likelihood estimates (MLEs) in problems with missing data. Each iteration of the al- gorithm formally consists of an E-step: evaluate the expected complete-data log-likelihood given the observed data, with expectation taken at current pa- rameter estimate; and an M-step: maximize the resulting expression to find the updated estimate. Conditions that guarantee convergence of the EM se- quence to a unique MLE were found by Boyles (1983) and Wu (1983). In complicated models for high-dimensional data, it is common to encounter an intractable integral in the E-step. The Monte Carlo EM algorithm of Wei and Tanner (1990) works around this difficulty by maximizing instead a Monte Carlo approximation to the appropriate conditional expectation. Convergence properties of Monte Carlo EM have been studied, most notably, by Chan and Ledolter (1995) and Fort and Moulines (2003). The goal of this review paper is to provide an accessible but rigorous in- troduction to the convergence properties of EM and Monte Carlo EM. No previous knowledge of the EM algorithm is assumed. We demonstrate the im- plementation of EM and Monte Carlo EM in two simple but realistic examples. We show that if the EM algorithm converges it converges to a stationary point of the likelihood, and that the rate of convergence is linear at best. For Monte Carlo EM we present a readable proof of the main result of Chan and Ledolter (1995), and state without proof the conclusions of Fort and Moulines (2003). An important practical implication of Fort and Moulines's (2003) result relates to the determination of Monte Carlo sample sizes in MCEM; we provide a brief review of the literature (Booth and Hobert, 1999; Caffo, Jank and Jones, 2005) on that problem.
Identifying the Optimal Integration Time in Hamiltonian Monte Carlo
通过利用光滑概率系统的自然几何结构,哈密顿蒙特卡罗产生计算效率高的马尔可夫链蒙特卡罗估计。至少在算法足够好的情况下。在本文中,我将展示如何几何基础的哈密顿蒙特卡罗隐含地确定这些参数的最佳选择,特别是积分时间。然后,我认为这些原则在现有的算法和一个新的实现称为\emph{Exhaustive Hamiltonian Monte Carlo}的实际后果,然后在一些说明性的例子证明这些想法的效用。
Some Contributions to Sequential Monte Carlo Methods for Option Pricing
期权定价是金融工程中的一个重要问题。在许多具有实际意义的场景中,与标的资产相关的金融期权价格简化为计算w.r.t.~扩散过程。一般来说,这些期望值无法通过分析计算,而近似这些数量的一种方法是通过蒙特卡罗方法;蒙特卡罗方法至少从20世纪70年代开始就被用于期权定价。在Del Moral,P.\& Shevchenko,P.V.(2014)"Valuation of barrier options using序贯蒙特卡罗"和Jasra,A. \& Del Moral,P.(2011)"期权定价的序贯蒙特卡罗",序贯蒙特卡罗(SMC)方法是应用于这种情况的自然工具,可以大大改善标准蒙特卡罗。在本文中,本着类似的精神,Del Moral,P.\& Shevchenko,P.V.(2014)"Valuation of barrier options using序贯蒙特卡罗"和Jasra,A. \& Del Moral,P.(2011)"期权定价的序贯蒙特卡罗"我们表明,通过构建一系列人工目标密度随时间的推移使用SMC方法可以实现显着收益。特别是,我们近似的最佳重要性抽样分布的SMC算法,通过使用一系列的加权函数。这是证明了两个例子,障碍期权和目标应计赎回票据(TARN的)。我们还提供了我们的SMC估计的无偏性的证明。