University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Unbounded-depth hierarchical Pitman-Yor processes

Unbounded-depth hierarchical Pitman-Yor processes

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Shakir Mohamed.

I will discuss the following paper, which introduces an infinite hierarchy of Chinese restaurant processes to model sequence data:

Wood, Archambeau, Gasthaus, James, Teh, “A Stochastic Memoizer for Sequence Data”. www.gatsby.ucl.ac.uk/ywteh/research/compling/WooArcGas2009a.pdf

As background reading: the hierarchical Pitman-Yor process was introduced in Teh, “A Hierarchical Bayesian Language Model based on Pitman-Yor Processes” http://www.gatsby.ucl.ac.uk/ywteh/research/compling/acl2006.pdf

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity