可选Pólya树的计算问题
Computational Aspects of Optional Pólya Tree
摘要:
Optional Pólya Tree(OPT)是一种用于密度估计的灵活的非参数贝叶斯模型。尽管它的优点,OPT推理的计算是具有挑战性的。在本文中,我们提出了时间复杂度分析的OPT推理,并提出了两个算法的改进。第一个改进,称为有限前瞻可选Pólya树(LL-OPT),旨在大大加快OPT推理的计算速度。第二个改进修改OPT或LL-OPT的输出,并产生连续的分段线性密度估计。我们证明了这两个改进的性能,使用模拟。
英文摘要:
Optional Pólya Tree (OPT) is a flexible non-parametric Bayesian model for density estimation. Despite its merits, the computation for OPT inference is challenging. In this paper we present time complexity analysis for OPT inference and propose two algorithmic improvements. The first improvement, named Limited-Lookahead Optional Pólya Tree (LL-OPT), aims at greatly accelerate the computation for OPT inference. The second improvement modifies the output of OPT or LL-OPT and produces a continuous piecewise linear density estimate. We demonstrate the performance of these two improvements using simulations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。