arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08787stat.CO
收藏

近似输运的吉布斯流及其在贝叶斯计算中的应用

Gibbs flow for approximate transport with applications to Bayesian computation

Jeremy Heng, Arnaud Doucet, Yvo Pokern

摘要:

设$π_{0}$和$π_{1}$是Borel空间$(\mathbb{R}^{d},\mathcal{B}(\mathbb{R}^{d}))$上的两个分布。任何可测量的函数$T:\mathbb{R}^{d}\rightarrow\mathbb{R}^{d}$,如果调用$X\simπ_{0}$,则$Y=T(X)\simπ_{1}$是从$π_{0}$到$π_{1}$的传输映射。对于任何$π_{0}$和$π_{1}$,如果可以获得从$π_{0}$到$π_{1}$的传输映射的分析表达式,则这可以直接应用于来自任何分布的样本。可以使用该传输映射将抽取从易于样本分布$π_{0}$映射到目标分布$π_{1}$。虽然它通常是不可能的,以获得一个明确的运输地图复杂的目标分布,我们在这里展示如何建立一个易于处理的近似一个新的运输地图。这是通过从$π_{0}$使用一个常微分方程的速度场,取决于目标的完整条件分布移动样本。即使当这个常微分方程是时间离散化和完整的条件分布的数值近似,映射样本的分布可以有效地评估和使用作为一个建议内的序贯蒙特卡罗采样器。我们证明了显着的收益超过国家的最先进的序贯蒙特卡罗采样器在一个固定的计算复杂度上的各种应用。

英文摘要:

Let $π_{0}$ and $π_{1}$ be two distributions on the Borel space $(\mathbb{R}^{d},\mathcal{B}(\mathbb{R}^{d}))$. Any measurable function $T:\mathbb{R}^{d}\rightarrow\mathbb{R}^{d}$ such that $Y=T(X)\simπ_{1}$ if $X\simπ_{0}$ is called a transport map from $π_{0}$ to $π_{1}$. For any $π_{0}$ and $π_{1}$, if one could obtain an analytical expression for a transport map from $π_{0}$ to $π_{1}$, then this could be straightforwardly applied to sample from any distribution. One would map draws from an easy-to-sample distribution $π_{0}$ to the target distribution $π_{1}$ using this transport map. Although it is usually impossible to obtain an explicit transport map for complex target distributions, we show here how to build a tractable approximation of a novel transport map. This is achieved by moving samples from $π_{0}$ using an ordinary differential equation with a velocity field that depends on the full conditional distributions of the target. Even when this ordinary differential equation is time-discretized and the full conditional distributions are numerically approximated, the resulting distribution of mapped samples can be efficiently evaluated and used as a proposal within sequential Monte Carlo samplers. We demonstrate significant gains over state-of-the-art sequential Monte Carlo samplers at a fixed computational complexity on a variety of applications.

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

↑