Feynman-Kac Particle Integration with Geometric Interacting Jumps

Abstract

This article is concerned with the design and analysis of discrete time Feynman-Kac particle integration models with geometric interacting jump processes. We analyze two general types of model, corresponding to whether the reference process is in continuous or discrete time. For the former, we consider discrete generation particle models defined by arbitrarily fine time mesh approximations of the Feynman-Kac models with continuous time path integrals. For the latter, we assume that the discrete process is observed at integer times and we design new approximation models with geometric interacting jumps in terms of a sequence of intermediate time steps between the integers. In both situations, we provide non asymptotic bias and variance theorems w.r.t. the time step and the size of the system, yielding what appear to be the first results of this type for this class of Feynman-Kac particle integration models. We also discuss uniform convergence estimates w.r.t. the time horizon. Our approach is based on an original semigroup analysis with first order decompositions of the fluctuation errors.

A second order analysis of McKean–Vlasov semigroups

“…The above evolution equation is rather standard in mean field type interacting particle system theory, a detailed proof can be found in [29] (see for instance section 4.3). In the same vein, with some obvious abusive notation, using (2.22) we have…”

A duality formula for Feynman–Kac path particle models

“…For sufficiently large population sizes, a more refined estimate is provided in (11), under some additional mild stability properties on the Feynman-Kac flow η n .…”

“…They are often termed Resampled Monte Carlo methods, or Diffusion Monte Carlo methodologies. For a more thorough discussion of these continuous-time models and their applications in chemistry and physics, see [2,3,11,[13][14][15][16], the recent monograph [8], and the references therein.…”

Bayesian State-Space Modelling on High-Performance Hardware UsingLibBi

“…This means that all threads must synchronize. The development of asynchronous resampling methods to alleviate this bottleneck is still an active area of research [50,55,12]. In the meantime, the particle filter is best suited to shared-memory architectures where the collective operation can be performed efficiently, although approaches for distributed-memory resampling have been proposed [7].…”