具有粒子随机逼近的学习动力系统EM
Learning dynamical systems with particle stochastic approximation EM
摘要:
提出了一种用于动力系统学习的粒子随机逼近EM(PSAEM)算法。该方法建立在期望最大化算法的基础上,EM算法是潜变量模型中极大似然推断的迭代过程。通过结合随机逼近EM和粒子吉布斯与祖先采样(PGAS),PSAEM获得优越的计算性能和收敛性能相比,普通的粒子平滑为基础的近似的期望最大化算法。PSAEM可用于普通的极大似然推理以及超参数的经验贝叶斯学习。具体来说,后一点意味着现有的PGAS实现可以很容易地用PSAEM扩展,以几乎没有额外的计算成本来估计超参数。我们讨论了该算法的收敛性,并证明了它在几个信号处理应用。
英文摘要:
We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining stochastic approximation EM and particle Gibbs with ancestor sampling (PGAS), PSAEM obtains superior computational performance and convergence properties compared to plain particle-smoothing-based approximations of the EM algorithm. PSAEM can be used for plain maximum likelihood inference as well as for empirical Bayes learning of hyperparameters. Specifically, the latter point means that existing PGAS implementations easily can be extended with PSAEM to estimate hyperparameters at almost no extra computational cost. We discuss the convergence properties of the algorithm, and demonstrate it on several signal processing applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。