Inexact Markov Chain Monte Carlo methods rely on Markov chains that do not exactly preserve the target distribution. Examples include the unadjusted Langevin algorithm (ULA) and unadjusted Hamiltonian Monte Carlo (uHMC). This paper establishes bounds on Wasserstein distances between the invariant probability measures of inexact MCMC methods and their target distributions with a focus on understanding the precise dependence of this asymptotic bias on both dimension and discretization step size. Assuming Wasserstein bounds on the convergence to equilibrium of either the exact or the approximate dynamics, we show that for both ULA and uHMC, the asymptotic bias depends on key quantities related to the target distribution or the stationary probability measure of the scheme. As a corollary, we conclude that for models with a limited amount of interactions such as mean-field models, finite range graphical models, and perturbations thereof, the asymptotic bias has a similar dependence on the step size and the dimension as for product measures.
翻译:不精確馬爾可夫鏈蒙地卡羅方法依賴不完全保持目標分佈的馬爾可夫鏈。其中包括未校正蘭逊渐进算法(ULA)和未校正哈密顿蒙地卡羅(uHMC)。本文根据目标分布或方案的定常概率测度,关注了在维度和离散化步长方面的误差。假设对于精确或近似动力学的收敛到平衡的Wasserstein距离的边界,我们显示出对于ULA和uHMC,渐近偏差取决于与目标分布或方案的不变概率测度有关的关键量。作为推论,我们得出结论:对于具有有限交互量的模型(例如均场模型、有限范围图模型和其扰动),与产品测度相比,渐近偏差具有类似的对于步长和维度的依赖性。