On the performance of parallelisation schemes for particle filtering

Autor: Dan Crisan, Joaquín Míguez, Gonzalo Ríos-Muñoz
Jazyk: angličtina
Rok vydání: 2018
Předmět:
Zdroj: EURASIP Journal on Advances in Signal Processing, Vol 2018, Iss 1, Pp 1-18 (2018)
Druh dokumentu: article
ISSN: 1687-6180
DOI: 10.1186/s13634-018-0552-x
Popis: Abstract Considerable effort has been recently devoted to the design of schemes for the parallel implementation of sequential Monte Carlo (SMC) methods for dynamical systems, also widely known as particle filters (PFs). In this paper, we present a brief survey of recent techniques, with an emphasis on the availability of analytical results regarding their performance. Most parallelisation methods can be interpreted as running an ensemble of lower-cost PFs, and the differences between schemes depend on the degree of interaction among the members of the ensemble. We also provide some insights on the use of the simplest scheme for the parallelisation of SMC methods, which consists in splitting the computational budget into M non-interacting PFs with N particles each and then obtaining the desired estimators by averaging over the M independent outcomes of the filters. This approach minimises the parallelisation overhead yet still displays desirable theoretical properties. We analyse the mean square error (MSE) of estimators of moments of the optimal filtering distribution and show the effect of the parallelisation scheme on the approximation error rates. Following these results, we propose a time–error index to compare schemes with different degrees of parallelisation. Finally, we provide two numerical examples involving stochastic versions of the Lorenz 63 and Lorenz 96 systems. In both cases, we show that the ensemble of non-interacting PFs can attain the approximation accuracy of a centralised PF (with the same total number of particles) in just a fraction of its running time using a standard multicore computer.
Databáze: Directory of Open Access Journals
Externí odkaz: