An Infinite Hidden Markov Model With Similarity-Biased Transitions
Colin Reimer Dawson, Chaofan Huang, Clayton T. Morrison

TL;DR
This paper introduces a generalized HDP-HMM that incorporates state similarity to model more realistic transition dynamics, enabling better performance on tasks like speaker diarization and musical analysis.
Contribution
It proposes a similarity-biased transition mechanism within the HDP-HMM, restoring conjugacy and simplifying inference through an augmented Markov Jump Process representation.
Findings
Improved performance on speaker diarization and harmonic parsing tasks.
Effective modeling of transitions between similar states.
Competitive results on synthetic datasets.
Abstract
We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pair-wise similarities, thereby inducing correlations among the transition distributions. We present an augmented data representation of the model as a Markov Jump Process in which: (1) some jump attempts fail, and (2) the probability of success is proportional to the similarity between the source and destination states. This augmentation restores conditional conjugacy and admits a simple Gibbs sampler. We evaluate the model and inference method on a speaker diarization task and a "harmonic parsing" task using four-part chorale data, as well as on several synthetic datasets,…
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
TopicsBayesian Methods and Mixture Models · Algorithms and Data Compression · Markov Chains and Monte Carlo Methods
