Predictive recursion (PR) is a fast, recursive algorithm that gives a smooth estimate of the mixing distribution under the general mixture model. However, the PR algorithm requires evaluation of a normalizing constant at each iteration. When the support of the mixing distribution is of relatively low dimension, this is not a problem since quadrature methods can be used and are very efficient. But when the support is of higher dimension, quadrature methods are inefficient and there is no obvious Monte Carlo-based alternative. In this paper, we propose a new strategy, which we refer to as a PRticle filter, wherein we augment the basic PR algorithm with a filtering mechanism that adaptively reweights an initial set of particles along the updating sequence which are used to obtain Monte Carlo approximations of the normalizing constants. Convergence properties of the PRticle filter approximation are established and its empirical accuracy is demonstrated with simulation studies and a marked spatial point process data analysis.
翻译:预测递归(PR)是一种快速、循环的算法,它能对一般混合物模型下的混合分布作出平稳的估计。然而,PR算法要求在每个迭代中评估一个正常常数。当混合分布的支持是相对较低的维度时,这不是一个问题,因为二次递解方法可以使用,而且非常有效。但是,当支持是更高维度时,二次递解方法效率低下,而且没有明显的蒙特卡洛替代方法。在本文中,我们提出了一个新战略,我们称之为钚过滤器,我们用过滤机制来补充基本的PR算法,通过一种过滤机制,对最初的一组粒子进行适应性再加权,并沿更新序列来获取正常常数的蒙特卡洛近似值。 圆球过滤近似的趋同特性得到确立,其经验准确性通过模拟研究和明显的空间点数据分析得到证明。