Products of Hidden Markov Models: It Takes N>1 to Tango
Graham W Taylor, Geoffrey E. Hinton

TL;DR
This paper explores Products of Hidden Markov Models (PoHMMs), demonstrating how to estimate their partition function reliably and showing their potential for complex time-series modeling with recent computational advances.
Contribution
It introduces a reliable method for estimating the partition function of PoHMMs and demonstrates their applicability to real-world time-series data.
Findings
Partition function can be estimated via Annealed Importance Sampling.
Contrastive divergence learning applied successfully to rainfall and dance data.
PoHMMs are promising for complex time-series modeling with increased computational power.
Abstract
Products of Hidden Markov Models(PoHMMs) are an interesting class of generative models which have received little attention since their introduction. This maybe in part due to their more computationally expensive gradient-based learning algorithm,and the intractability of computing the log likelihood of sequences under the model. In this paper, we demonstrate how the partition function can be estimated reliably via Annealed Importance Sampling. We perform experiments using contrastive divergence learning on rainfall data and data captured from pairs of people dancing. Our results suggest that advances in learning and evaluation for undirected graphical models and recent increases in available computing power make PoHMMs worth considering for complex time-series modeling tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques
