More Aspects of Polya Tree Distributions for Statistical Modelling

Lavine, Michael

Ann. Statist., Tome 22 (1994) no. 1, p. 1161-1176 / Harvested from Project Euclid

Résumé

The definition and elementary properties of Polya tree distributions are reviewed. Two theorems are presented showing that Polya trees can be constructed to concentrate arbitrarily closely about any desired pdf, and that Polya tree priors can put positive mass in every relative entropy neighborhood of every positive density with finite entropy, thereby satisfying a consistency condition. Such theorems are false for Dirichlet processes. Models are constructed combining partially specified Polya trees with other information such as monotonicity or unimodality. It is shown how to compute bounds on posterior expectations over the class of all priors with the given specifications. A numerical example is given. A theorem of Diaconis and Freedman about Dirichlet processes is generalized to Polya trees, allowing Polya trees to be the models for errors in regression problems. Finally, empirical Bayes models using Dirichlet processes are generalized to Polya trees. An example from Berry and Christensen is reanalyzed with a Polya tree model.

Détail

Publié le : 1994-09-14
Classification:  Dirichlet processes,  nonparametric regression,  robust Bayes,  tail-free processes,  62A15,  62G07,  62G99