Inference of collective Gaussian hidden Markov models

07/24/2021
by   Rahul Singh, et al.
0

We consider inference problems for a class of continuous state collective hidden Markov models, where the data is recorded in aggregate (collective) form generated by a large population of individuals following the same dynamics. We propose an aggregate inference algorithm called collective Gaussian forward-backward algorithm, extending recently proposed Sinkhorn belief propagation algorithm to models characterized by Gaussian densities. Our algorithm enjoys convergence guarantee. In addition, it reduces to the standard Kalman filter when the observations are generated by a single individual. The efficacy of the proposed algorithm is demonstrated through multiple experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2020

Filtering for Aggregate Hidden Markov Models with Continuous Observations

We consider a class of filtering problems for large populations where ea...
research
11/23/2020

Learning Hidden Markov Models from Aggregate Observations

In this paper, we propose an algorithm for estimating the parameters of ...
research
06/26/2020

Incremental inference of collective graphical models

We consider incremental inference problems from aggregate data for colle...
research
11/28/2018

Kalman filter demystified: from intuition to probabilistic graphical model to real case in financial markets

In this paper, we revisit the Kalman filter theory. After giving the int...
research
05/20/2014

Gaussian Approximation of Collective Graphical Models

The Collective Graphical Model (CGM) models a population of independent ...
research
10/06/2009

Reduced-Rank Hidden Markov Models

We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generaliza...
research
04/08/2014

Outer-Product Hidden Markov Model and Polyphonic MIDI Score Following

We present a polyphonic MIDI score-following algorithm capable of follow...

Please sign up or login with your details

Forgot password? Click here to reset