Scalable Filtering of Large Graph-Coupled Hidden Markov Models

Abstract

We consider the online filtering problem for a graph-coupled hidden Markov model (GHMM) with the Anonymous Influence property. Large-scale spatial processes such as forest res, social networks, disease epidemics, and robot swarms are often modeled by GHMMs with this property. We derive a scalable online recursive algorithm to produce a belief over states for each HMM node in the GHMM at each time step, given a history of noisy observations. In contrast to prior work, our algorithm is tractable for the high-dimensional discrete state spaces of GHMMs with arbitrary graph structure, and our method scales linearly with the total number of HMMs, i.e., nodes in the graph. We demonstrate the accuracy and scaling of our method using simulation experiments of a wild re model containing 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">298</sup> total states and a disease epidemic model containing 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">18</sup> states.