## GPU acceleration of the particle filter: the Metropolis resampler

CSIRO Mathematics, Informatics and Statistics, Perth WA, Australia

arXiv:1202.6163v1 [stat.CO] (28 Feb 2012)

@article{2012arXiv1202.6163M,

author={Murray}, L.},

title={"{GPU acceleration of the particle filter: the Metropolis resampler}"},

journal={ArXiv e-prints},

archivePrefix={"arXiv"},

eprint={1202.6163},

primaryClass={"stat.CO"},

keywords={Statistics – Computation, Computer Science – Distributed, Parallel, and Cluster Computing},

year={2012},

month={feb},

adsurl={http://adsabs.harvard.edu/abs/2012arXiv1202.6163M},

adsnote={Provided by the SAO/NASA Astrophysics Data System}

}

We consider deployment of the particle filter on modern massively parallel hardware architectures, such as Graphics Processing Units (GPUs), with a focus on the resampling stage. While standard multinomial and stratified resamplers require a sum of importance weights computed collectively between threads, a Metropolis resampler favourably requires only pair-wise ratios between weights, computed independently by threads, and can be further tuned for performance by adjusting its number of iterations. While achieving respectable results for the stratified and multinomial resamplers, we demonstrate that a Metropolis resampler can be faster where the variance in importance weights is modest, and so is worth considering in a performance-critical context, such as particle Markov chain Monte Carlo and real-time applications.

March 1, 2012 by hgpu