Haar-Weave-Metropolis核
Haar-Weave-Metropolis kernel
摘要:
近年来,受哈密顿蒙特卡罗方法的启发,许多马尔可夫链蒙特卡罗方法被发展为确定性可逆变换方法。确定性变换相对容易与局部信息(梯度等)协调。的目标分布。然而,遍历理论表明,这些确定性的建议方法似乎是不兼容的鲁棒性,并导致收敛性差,特别是在目标分布的情况下,厚尾。另一方面,使用Haar测度的马尔可夫核是相对鲁棒的,因为它学习关于目标分布的全局信息,引入全局参数。然而,它需要一个密度保持条件,许多确定性的建议打破了这个条件。在本文中,我们仔细选择的确定性变换,保持结构和创建一个马尔可夫核,编织大都会内核,使用确定性变换。结合Haar测度,我们还引入了Haar-Weave-Metropolis核。以这种方式,马尔可夫核可以使用确定性建议来使用目标分布的局部信息,并且由于Haar测度,它可以使用目标分布的全局信息。最后,我们通过数值实验表明,所提出的方法的性能优于其他方法的有效样本量和均方跳每秒的距离。
英文摘要:
Recently, many Markov chain Monte Carlo methods have been developed with deterministic reversible transform proposals inspired by the Hamiltonian Monte Carlo method. The deterministic transform is relatively easy to reconcile with the local information (gradient etc.) of the target distribution. However, as the ergodic theory suggests, these deterministic proposal methods seem to be incompatible with robustness and lead to poor convergence, especially in the case of target distributions with heavy tails. On the other hand, the Markov kernel using the Haar measure is relatively robust since it learns global information about the target distribution introducing global parameters. However, it requires a density preserving condition, and many deterministic proposals break this condition. In this paper, we carefully select deterministic transforms that preserve the structure and create a Markov kernel, the Weave-Metropolis kernel, using the deterministic transforms. By combining with the Haar measure, we also introduce the Haar-Weave-Metropolis kernel. In this way, the Markov kernel can employ the local information of the target distribution using the deterministic proposal, and thanks to the Haar measure, it can employ the global information of the target distribution. Finally, we show through numerical experiments that the performance of the proposed method is superior to other methods in terms of effective sample size and mean square jump distance per second.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。