Teh 2010 - Extensions and Reference Map

Summary

The DP generalises along several axes: a discount parameter (Pitman-Yor), other representations (Polya trees, normalised random measures, Poisson-Kingman, species sampling, stick-breaking priors), dependence across covariates (dependent DP) and groups (hierarchical DP). Teh lists open directions: inference, new objects, consistency theory and applications.

Main Content

Generalisations (pp. 10-11).

  • Pitman-Yor process : adds a discount ; is the DP. It has CRP and stick-breaking analogues and fits power-law data (Goldwater et al. 2006; Teh 2006 language model). Fully treated in De Blasi 2015 - Subclasses Pitman-Yor NGG and Finite-Species Priors.
  • Other priors obtained by generalising a representation: Polya trees, normalised random measures, Poisson-Kingman models, species sampling models, stick-breaking priors.
  • Dependent DP (MacEachern 1999): one random measure per covariate value. Hierarchical DP (Teh et al. 2006): one measure per group (task), with dependence through a shared DP base.

Future directions. Efficient inference (split-merge, large-step auxiliary-variable MCMC, SMC, EP, variational); extensions to new random distributions; consistency and convergence theory; applications to clustering, transfer learning, relational learning, cognition, sequence learning and regression.

Examples

Teh’s claim that the ” reduces to DP” can be checked against the Pitman-Yor predictive rule in De Blasi 2015 - EPPF and Predictive Structure: setting in gives , the CRP.

Connections

HDP-based topic models (Teh et al. 2006) pick for LDA nonparametrically: Blei 2003 - Latent Dirichlet Allocation - Overview covers the finite- case; Concept - Neural and Embedding Topic Models mentions alternatives.

See Also

Teh 2010 - Dirichlet Process - Overview