arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.10916cs.CGcs.DM
收藏

DBSOP:多面体上快速MCMC采样的有效启发式算法

DBSOP: An Efficient Heuristic for Speedy MCMC Sampling on Polytopes

Christos Karras, Aristeidis Karras

摘要:

马尔可夫链蒙特卡罗(MCMC)技术在计算几何学科中已经研究了很长时间,其中要研究的问题是复杂的几何对象,其本质上需要部署优化的技术或通过它们获得有用的见解。MCMC方法直接回答我们试图回答的几何问题,以及如何将这些问题从理论部署到实践。多面体是由一组线性不等式约束所指定的n维空间中的有限体积,需要特定的逼近。因此,如果不使用这样的方法,就不能在基于密度的多面体上进行采样,其中所需的重复量被定义为误差容限的属性。在这项工作中,我们提出了一个简单的准确的采样方法的基础上三角剖分(镶嵌)的多面体。此外,我们提出了一种高效的算法,名为基于多面体密度的采样(DBSOP),用于快速MCMC采样,与现有的低维复杂性方法相比,执行采样所需的时间显着降低$\mathcal{O}^{*}\left(n^{3}\right)$。最后,我们强调未来可能的方面,以及如何进一步改进所提出的方案,与集成的采样为基础的方法,从而更快速,更有效的解决方案。

英文摘要:

Markov Chain Monte Carlo (MCMC) techniques have long been studied in computational geometry subjects whereabouts the problems to be studied are complex geometric objects which by their nature require optimized techniques to be deployed or to gain useful insights by them. MCMC approaches are directly answering to geometric problems we are attempting to answer, and how these problems could be deployed from theory to practice. Polytope which is a limited volume in n-dimensional space specified by a collection of linear inequality constraints require specific approximation. Therefore, sampling across density based polytopes can not be performed without the use of such methods in which the amount of repetition required is defined as a property of error margin. In this work we propose a simple accurate sampling approach based on the triangulation (tessellation) of a polytope. Moreover, we propose an efficient algorithm named Density Based Sampling on Polytopes (DBSOP) for speedy MCMC sampling where the time required to perform sampling is significantly lower compared to existing approaches in low dimensions with complexity $\mathcal{O}^{*}\left(n^{3}\right)$. Ultimately, we highlight possible future aspects and how the proposed scheme can be further improved with the integration of reservoir-sampling based methods resulting in more speedy and efficient solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑