The Recurrent Sticky Hierarchical Dirichlet Process Hidden Markov Model

Mikołaj Słupiński, Piotr Lipiński
11/6/2024
cs.LGcs.AImath.DS

No official code found. Best implementation: zhd96/ds-hdp-hmm (37 stars, last commit 2020-08-04).

Abstract

The Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) is a natural Bayesian nonparametric extension of the classical Hidden Markov Model for learning from (spatio-)temporal data. A sticky HDP-HMM has been proposed to strengthen the self-persistence probability in the HDP-HMM. Then, disentangled sticky HDP-HMM has been proposed to disentangle the strength of the self-persistence prior and transition prior. However, the sticky HDP-HMM assumes that the self-persistence probability is stationary, limiting its expressiveness. Here, we build on previous work on sticky HDP-HMM and disentangled sticky HDP-HMM, developing a more general model: the recurrent sticky HDP-HMM (RS-HDP-HMM). We develop a novel Gibbs sampling strategy for efficient inference in this model. We show that RS-HDP-HMM outperforms disentangled sticky HDP-HMM, sticky HDP-HMM, and HDP-HMM in both synthetic and real data segmentation.

View on arXivView PDF

Code Implementations(1)

zhd96/ds-hdp-hmmCommunity100%

Disentangled Sticky Hierarchical Dirichlet Process Hidden Markov Model

3715PythonApr 6, 20206 years ago

Similar Papers

Cite this paper

@article{supiski2024recurrent,
  title  = {The Recurrent Sticky Hierarchical Dirichlet Process Hidden Markov Model},
  author = {Mikołaj Słupiński and Piotr Lipiński},
  year   = {2024},
  eprint = {2411.04278},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.04278v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.04278.svg)](https://codeofpaper.com/paper/2411.04278)

Discussion