LGAIDSMLNov 6, 2024

The Recurrent Sticky Hierarchical Dirichlet Process Hidden Markov Model

arXiv:2411.04278v1Has CodeECAI
Originality Synthesis-oriented
AI Analysis

This work addresses a specific modeling issue in Bayesian nonparametric HMMs for temporal data segmentation, representing an incremental improvement over existing methods.

The authors tackled the limitation of stationary self-persistence probability in sticky HDP-HMMs by developing the recurrent sticky HDP-HMM, which outperforms previous models in synthetic and real data segmentation.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes