揭示无调整哈密顿蒙特卡洛与欠阻尼朗之万算法的偏差扩散现象
Delocalization of bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin
- 提出矩阵多项式框架分析离散积分器传播特性
- 高维分布任意K维边缘的W2偏差仅需O(√K)步控制
- 适用于大摩擦参数,对算法设计有指导意义
无调整采样器如无调整哈密顿蒙特卡洛和欠阻尼朗之万算法已知存在偏差。传统方法通过梅特罗波利斯-黑斯廷斯修正消除偏差,但会因小步长导致迭代复杂度显著上升。本文将此前在过阻尼朗之万算法中建立的偏差扩散现象扩展至这两种无调整算法。研究表明,在变量间弱相互作用或稀疏交互假设下,控制任意K维边际的W2偏差仅需O(√K)积分步数(含log d项)。针对离散时间积分器带来的技术难题,我们提出一种通用矩阵多项式框架以刻画其传播算子。对于欠阻尼朗之万算法,结果适用于所有大摩擦参数,意味着莱姆库勒-马修斯积分器对过阻尼朗之万动力学同样表现出偏差扩散现象。
原文摘要 · Abstract (English)
Unadjusted samplers such as unadjusted Hamiltonian Monte Carlo and underdamped Langevin are well-known to be biased. Metropolis--Hastings adjustment has been conventionally incorporated into Hamiltonian Monte Carlo to eliminate the bias. However, this adjustment can significantly increase the iteration complexity due to the small step size required for reasonable Metropolis acceptance rates. In this work, we extend the \emph{delocalization of bias} phenomenon, previously established for the overdamped Langevin algorithm, to these two unadjusted algorithms. We show that to control the $W_2$ bias of any $K$-dimensional marginal of a high-dimensional distribution, $O(\sqrt{K})$ integration steps suffice up to $\log d$ terms, assuming either weak or sparse interactions among variables. The discrete-time integrators here introduce technical difficulties beyond those of the overdamped setting, which we address through a broadly applicable matrix-polynomial framework that characterizes their propagators. Our result for the underdamped Langevin algorithm is valid for all large friction parameters, implying that the Leimkuhler-Matthews integrator for the overdamped Langevin dynamics also exhibits delocalization of bias.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。