MapReduce Particle Filtering with Exact Resampling and Deterministic Runtime.

Thiyagalingam, Jeyarajan, Kekempanos, Lykourgos and Maskell, Simon ORCID: 0000-0003-1917-2913 (2017) MapReduce Particle Filtering with Exact Resampling and Deterministic Runtime. [Artefact]

There is a more recent version of this item available.

Text
1705.01660v1.pdf - Submitted version
Download (790kB)

Abstract

Particle filtering is a numerical Bayesian technique that has great potential for solving sequential estimation problems involving non-linear and non-Gaussian models. Since the estimation accuracy achieved by particle filters improves as the number of particles increases, it is natural to consider as many particles as possible. MapReduce is a generic programming model that makes it possible to scale a wide variety of algorithms to Big data. However, despite the application of particle filters across many domains, little attention has been devoted to implementing particle filters using MapReduce. In this paper, we describe an implementation of a particle filter using MapReduce. We focus on a component that what would otherwise be a bottleneck to parallel execution, the resampling component. We devise a new implementation of this component, which requires no approximations, has $O\left(N\right)$ spatial complexity and deterministic $O\left(\left(\log N\right)^2\right)$ time complexity. Results demonstrate the utility of this new component and culminate in consideration of a particle filter with $2^{24}$ particles being distributed across $512$ processor cores.

Item Type:	Artefact
Additional Information:	31 pages, 16 figures
Uncontrolled Keywords:	stat.CO, stat.CO, cs.DC
Depositing User:	Symplectic Admin
Date Deposited:	21 Sep 2017 08:31
Last Modified:	19 Jan 2023 06:54
Related URLs:	http://arxiv.org/abs/1705.01660v1
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3009540