Temporal Parallelization of Inference in Hidden Markov Models

Syeda Sakira Hassan, Simo Särkkä, Ángel F. García-Fernández

Abstract

This paper presents algorithms for the parallelization of inference in hidden Markov models (HMMs). In particular, we propose a parallel forward-backward type of filtering and smoothing algorithm as well as a parallel Viterbi-type maximum-a-posteriori (MAP) algorithm. We define associative elements and operators to pose these inference problems as all-prefix-sums computations and parallelize them using the parallel-scan algorithm. The advantage of the proposed algorithms is that they are computationally efficient in HMM inference problems with long time horizons. We empirically compare the performance of the proposed methods to classical methods on a highly parallel graphics processing unit (GPU).
BibTeX
@article{hassan2021temporal,
  author = {Syeda Sakira Hassan and Simo Särkkä and Ángel F. García-Fernández},
  title = {{Temporal Parallelization of Inference in Hidden Markov Models}},
  journal = {IEEE Trans. Signal Process.},
  year = {2021},
  url = {https://openreview.net/forum?id=9werj6gfLOn},
}
Figure