arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.02279stat.MEmath.STstat.TH
收藏

粒子滤波器归一化常数估计的二阶矩近似算法

An algorithm for approximating the second moment of the normalizing constant estimate from a particle filter

Svetoslav Kostov, Nick Whiteley

摘要:

我们提出了一种新的算法来近似非渐近的边缘似然估计的二阶矩,或归一化常数,由粒子滤波器提供。新方法的计算成本是$O(M)$每时间步,独立的粒子数$N$在粒子滤波器,其中$M$是一个参数控制的近似质量。这与使用$M$ i.i.d.的简单平均技术的$O(MN)$形成对比。具有$N$颗粒的粒子滤波器的重复。我们建立的新算法提供的近似是无偏的,强一致的,在标准的正则条件下,随着时间线性增加$M$是足以防止增长的近似的相对方差,而对于简单的平均技术,它可以是必要的,以达到相同的效果,随着时间的指数增加$M$。数值例子说明了随机Lotka \textendash Volterra系统和一个简单的AR(1)模型的上下文中的性能。

英文摘要:

We propose a new algorithm for approximating the non-asymptotic second moment of the marginal likelihood estimate, or normalizing constant, provided by a particle filter. The computational cost of the new method is $O(M)$ per time step, independently of the number of particles $N$ in the particle filter, where $M$ is a parameter controlling the quality of the approximation. This is in contrast to $O(MN)$ for a simple averaging technique using $M$ i.i.d. replicates of a particle filter with $N$ particles. We establish that the approximation delivered by the new algorithm is unbiased, strongly consistent and, under standard regularity conditions, increasing $M$ linearly with time is sufficient to prevent growth of the relative variance of the approximation, whereas for the simple averaging technique it can be necessary to increase $M$ exponentially with time in order to achieve the same effect. Numerical examples illustrate performance in the context of a stochastic Lotka\textendash Volterra system and a simple AR(1) model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑