Skip to main content
Article thumbnail
Location of Repository

Flexible martingale priors for deep hierarchies

By Jacob Steinhardt and Zoubin Ghahramani

Abstract

We present an infinitely exchangeable prior over discrete tree structures that allows the depth of the tree to grow with the data. We show that the depth of the tree under the prior increases with the amount of data, which distinguishes it from any existing model; we then implement the model for a hierarchical beta process. We also show that deep hierarchical models are in general intimately tied to a process called a martingale, and use Doob’s martingale convergence theorem to demonstrate some unexpected properties of deep hierarchies.

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.2143
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://cs.stanford.edu/~jstein... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.