Hierarchical Dirichlet process
In statistics and machine learning, the hierarchical Dirichlet process (HDP) is a nonparametric Bayesian approach to clustering grouped data.[1][2] It uses a Dirichlet process for each group of data, with the Dirichlet processes for all groups sharing a base distribution which is itself drawn from a Dirichlet process. This method allows groups to share statistical strength via sharing of clusters across groups. The base distribution being drawn from a Dirichlet process is important, because draws from a Dirichlet process are atomic probability measures, and the atoms will appear in all group-level Dirichlet processes. Since each atom corresponds to a cluster, clusters are shared across all groups. It was developed by Yee Whye Teh, Michael I. Jordan, Matthew J. Beal and David Blei and published in the Journal of the American Statistical Association in 2006,[1] as a formalization and generalization of the infinite hidden Markov model published in 2002.[3]
Model
This model description is sourced from.[1] The HDP is a model for grouped data. What this means is that the data items come in multiple distinct groups. For example, in a topic model words are organized into documents, with each document formed by a bag (group) of words (data items). Indexing groups by [math]\displaystyle{ j=1,...J }[/math], suppose each group consist of data items [math]\displaystyle{ x_{j1},...x_{jn} }[/math].
The HDP is parameterized by a base distribution [math]\displaystyle{ H }[/math] that governs the a priori distribution over data items, and a number of concentration parameters that govern the a priori number of clusters and amount of sharing across groups. The [math]\displaystyle{ j }[/math]th group is associated with a random probability measure [math]\displaystyle{ G_j }[/math] which has distribution given by a Dirichlet process:
- [math]\displaystyle{ \begin{align} G_j|G_0 &\sim \operatorname{DP}(\alpha_j,G_0) \end{align} }[/math]
where [math]\displaystyle{ \alpha_j }[/math] is the concentration parameter associated with the group, and [math]\displaystyle{ G_0 }[/math] is the base distribution shared across all groups. In turn, the common base distribution is Dirichlet process distributed:
- [math]\displaystyle{ \begin{align} G_0 &\sim \operatorname{DP}(\alpha_0,H) \end{align} }[/math]
with concentration parameter [math]\displaystyle{ \alpha_0 }[/math] and base distribution [math]\displaystyle{ H }[/math]. Finally, to relate the Dirichlet processes back with the observed data, each data item [math]\displaystyle{ x_{ji} }[/math] is associated with a latent parameter [math]\displaystyle{ \theta_{ji} }[/math]:
- [math]\displaystyle{ \begin{align} \theta_{ji}|G_j &\sim G_j \\ x_{ji}|\theta_{ji} &\sim F(\theta_{ji}) \end{align} }[/math]
The first line states that each parameter has a prior distribution given by [math]\displaystyle{ G_j }[/math], while the second line states that each data item has a distribution [math]\displaystyle{ F(\theta_{ji}) }[/math] parameterized by its associated parameter. The resulting model above is called a HDP mixture model, with the HDP referring to the hierarchically linked set of Dirichlet processes, and the mixture model referring to the way the Dirichlet processes are related to the data items.
To understand how the HDP implements a clustering model, and how clusters become shared across groups, recall that draws from a Dirichlet process are atomic probability measures with probability one. This means that the common base distribution [math]\displaystyle{ G_0 }[/math] has a form which can be written as:
- [math]\displaystyle{ \begin{align} G_0 &= \sum_{k=1}^\infty \pi_{0k}\delta_{\theta^*_k} \end{align} }[/math]
where there are an infinite number of atoms, [math]\displaystyle{ \theta^*_k, k=1,2,... }[/math], assuming that the overall base distribution [math]\displaystyle{ H }[/math] has infinite support. Each atom is associated with a mass [math]\displaystyle{ \pi_{0k} }[/math]. The masses have to sum to one since [math]\displaystyle{ G_0 }[/math] is a probability measure. Since [math]\displaystyle{ G_0 }[/math] is itself the base distribution for the group specific Dirichlet processes, each [math]\displaystyle{ G_j }[/math] will have atoms given by the atoms of [math]\displaystyle{ G_0 }[/math], and can itself be written in the form:
- [math]\displaystyle{ \begin{align} G_j &= \sum_{k=1}^\infty \pi_{jk}\delta_{\theta^*_k} \end{align} }[/math]
Thus the set of atoms is shared across all groups, with each group having its own group-specific atom masses. Relating this representation back to the observed data, we see that each data item is described by a mixture model:
- [math]\displaystyle{ \begin{align} x_{ji}|G_j &\sim \sum_{k=1}^\infty \pi_{jk} F(\theta^*_k) \end{align} }[/math]
where the atoms [math]\displaystyle{ \theta^*_k }[/math] play the role of the mixture component parameters, while the masses [math]\displaystyle{ \pi_{jk} }[/math] play the role of the mixing proportions. In conclusion, each group of data is modeled using a mixture model, with mixture components shared across all groups but mixing proportions being group-specific. In clustering terms, we can interpret each mixture component as modeling a cluster of data items, with clusters shared across all groups, and each group, having its own mixing proportions, composed of different combinations of clusters.
Applications
The HDP mixture model is a natural nonparametric generalization of Latent Dirichlet allocation, where the number of topics can be unbounded and learnt from data.[1] Here each group is a document consisting of a bag of words, each cluster is a topic, and each document is a mixture of topics. The HDP is also a core component of the infinite hidden Markov model,[3] which is a nonparametric generalization of the hidden Markov model allowing the number of states to be unbounded and learnt from data.[1][4]
Generalizations
The HDP can be generalized in a number of directions. The Dirichlet processes can be replaced by Pitman-Yor processes and Gamma processes, resulting in the Hierarchical Pitman-Yor process and Hierarchical Gamma process. The hierarchy can be deeper, with multiple levels of groups arranged in a hierarchy. Such an arrangement has been exploited in the sequence memoizer, a Bayesian nonparametric model for sequences which has a multi-level hierarchy of Pitman-Yor processes. In addition, Bayesian Multi-Domain Learning (BMDL) model derives domain-dependent latent representations of overdispersed count data based on hierarchical negative binomial factorization for accurate cancer subtyping even if the number of samples for a specific cancer type is small.[5]
See also
- Chinese Restaurant Process
References
- ↑ 1.0 1.1 1.2 1.3 1.4 Teh, Y. W.; Jordan, M. I.; Beal, M. J.; Blei, D. M. (2006). "Hierarchical Dirichlet Processes". Journal of the American Statistical Association 101 (476): pp. 1566–1581. doi:10.1198/016214506000000302. http://www.gatsby.ucl.ac.uk/~ywteh/research/npbayes/jasa2006.pdf.
- ↑ Teh, Y. W.; Jordan, M. I. (2010). Hierarchical Bayesian Nonparametric Models with Applications. Cambridge University Press. 158–207. doi:10.1017/CBO9780511802478.006. ISBN 9780511802478. http://www.gatsby.ucl.ac.uk/~ywteh/research/npbayes/TehJor2010a.pdf.
- ↑ 3.0 3.1 Beal, M.J., Ghahramani, Z. and Rasmussen, C.E. (2002). "The infinite hidden Markov model" (PDF). Advances in Neural Information Processing Systems 14:577–585. Cambridge, MA: MIT Press.
- ↑ Fox, Emily B., et al. "A sticky HDP-HMM with application to speaker diarization." The Annals of Applied Statistics (2011): 1020-1056.
- ↑ Hajiramezanali, E. & Dadaneh, S. Z. & Karbalayghareh, A. & Zhou, Z. & Qian, X. "Bayesian multi-domain learning for cancer subtype discovery from next-generation sequencing count data" (PDF). 32nd Conference on Neural Information Processing Systems (NIPS 2018), Montréal, Canada.
 |  |
