probability density functions对数凸尾的两种自适应拒绝抽样方案
Two adaptive rejection sampling schemes for probability density functions log-convex tails
摘要:
蒙特卡罗方法通常是实现最优贝叶斯估计所必需的。一个基本的技术,可以用来从几乎任何目标概率分布产生样本是所谓的拒绝抽样方法,它产生候选样本的建议分布,然后接受他们或不通过测试的目标和建议的密度比。自适应拒绝抽样(ARS)算法是一类特别有趣的,因为它们可以实现高的接受率。然而,标准ARS方法只能用于对数凹目标密度。为此,已经提出了许多概括。在这项工作中,我们研究了两种不同的自适应方案,可以用来准确地从一个大家庭的单变量概率密度函数(PDF),不一定是对数凹,可能是多模态和尾巴的任意的双曲。这些技术是自适应的,在这个意义上,每次候选样本被拒绝,接受率提高。这两个算法可以正常工作时,目标PDF是多模态的,与一阶和二阶导数解析棘手,当尾巴是对数凸的无限域。因此,它们可以应用于标准ARS的其他概括失败的许多场景中。两个说明性的数值例子。
英文摘要:
Monte Carlo methods are often necessary for the implementation of optimal Bayesian estimators. A fundamental technique that can be used to generate samples from virtually any target probability distribution is the so-called rejection sampling method, which generates candidate samples from a proposal distribution and then accepts them or not by testing the ratio of the target and proposal densities. The class of adaptive rejection sampling (ARS) algorithms is particularly interesting because they can achieve high acceptance rates. However, the standard ARS method can only be used with log-concave target densities. For this reason, many generalizations have been proposed. In this work, we investigate two different adaptive schemes that can be used to draw exactly from a large family of univariate probability density functions (pdf's), not necessarily log-concave, possibly multimodal and with tails of arbitrary concavity. These techniques are adaptive in the sense that every time a candidate sample is rejected, the acceptance rate is improved. The two proposed algorithms can work properly when the target pdf is multimodal, with first and second derivatives analytically intractable, and when the tails are log-convex in a infinite domain. Therefore, they can be applied in a number of scenarios in which the other generalizations of the standard ARS fail. Two illustrative numerical examples are shown.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。