arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.4486math.PRcs.NAmath.NA
收藏

用于数值积分的Hit-and-run算法

Hit-and-run for numerical integration

Friedrich-Schiller-University Jena(耶拿弗里德里希·席勒大学)

Daniel Rudolf

AI总结:

针对凸体上对数凹密度函数的期望计算问题,利用hit-and-run算法和多链马尔可夫链蒙特卡洛方法,证明了该积分问题具有精细形式的可处理性。

摘要:

我们研究在凸体上由非归一化密度给出的测度下,有界函数期望的数值计算。假设密度是对数凹的,满足变异性条件且不太窄。我们考虑一般凸体甚至整个$\R^d$,并证明积分问题满足一种精细形式的可处理性。主要工具是hit-and-run算法和多链马尔可夫链蒙特卡洛方法的误差界。

英文摘要:

We study the numerical computation of an expectation of a bounded function with respect to a measure given by a non-normalized density on a convex body. We assume that the density is log-concave, satisfies a variability condition and is not too narrow. We consider general convex bodies or even the whole $\R^d$ and show that the integration problem satisfies a refined form of tractability. The main tools are the hit-and-run algorithm and an error bound of a multi run Markov chain Monte Carlo method.

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

↑