arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.14616stat.COq-bio.QMstat.AP
收藏

高阶Hit-&-Run采样器用于线性约束密度

Higher-Order Hit-&-Run Samplers for Linearly Constrained Densities

Forschungszentrum Jülich(于利希研究中心);Department of Statistics, LMU Munich(慕尼黑大学统计系);Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心)

Richard D. Paul, Anton Stratmann, Johann F. Jadebeck, Martin Beyß, Hanno Scharr, David Rügamer, Katharina Nöh

AI总结:

本文提出一种结合高阶信息与Hit-&-Run机制的约束采样算法,提升复杂约束密度下的采样效率。

摘要:

马尔可夫链蒙特卡洛(MCMC)采样受限于线性约束域的密度是一个在自然科学研究中重要的任务,特别是在贝叶斯逆问题处理中。尽管存在高效的均匀多面体采样算法,但针对更复杂的约束密度的研究却较少。特别是,在约束情况下,通常用于无约束MCMC的梯度信息可能并不有效,因为梯度可能将提议的密度推离多面体。在本工作中,我们提出了一种新的约束采样算法,该算法结合了高阶信息的优势,如目标函数的对数密度的梯度和曲率,与Hit-&-Run提议机制,这是一种简单的机制,能够保证生成可行的提议,满足线性约束。我们的广泛实验表明,在各种约束和无约束采样器上,该方法在复杂约束密度上的采样效率得到了提升。

英文摘要:

Markov chain Monte Carlo (MCMC) sampling of densities restricted to linearly constrained domains is an important task arising in Bayesian treatment of inverse problems in the natural sciences. While efficient algorithms for uniform polytope sampling exist, much less work has dealt with more complex constrained densities. In particular, gradient information as used in unconstrained MCMC is not necessarily helpful in the constrained case, where the gradient may push the proposal's density out of the polytope. In this work, we propose a novel constrained sampling algorithm, which combines strengths of higher-order information, like the target's log-density's gradients and curvature, with the Hit-&-Run proposal, a simple mechanism which guarantees the generation of feasible proposals, fulfilling the linear constraints. Our extensive experiments demonstrate improved sampling efficiency on complex constrained densities over various constrained and unconstrained samplers.

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

↑