首页> 美国卫生研究院文献>other >The Polya Tree Sampler: Towards Efficient and Automatic Independent Metropolis-Hastings Proposals
【2h】

The Polya Tree Sampler: Towards Efficient and Automatic Independent Metropolis-Hastings Proposals

机译:Polya树采样器:迈向高效和自动独立的大都市 - 黑斯廷斯建议

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We present a simple, efficient, and computationally cheap sampling method for exploring an un-normalized multivariate density on ℝd, such as a posterior density, called the Polya tree sampler. The algorithm constructs an independent proposal based on an approximation of the target density. The approximation is built from a set of (initial) support points – data that act as parameters for the approximation – and the predictive density of a finite multivariate Polya tree. In an initial “warming-up” phase, the support points are iteratively relocated to regions of higher support under the target distribution to minimize the distance between the target distribution and the Polya tree predictive distribution. In the “sampling” phase, samples from the final approximating mixture of finite Polya trees are used as candidates which are accepted with a standard Metropolis-Hastings acceptance probability. Several illustrations are presented, including comparisons of the proposed approach to Metropolis-within-Gibbs and delayed rejection adaptive Metropolis algorithm.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号