arXiv 1702.083972017-02stat.CO

Forward Event-Chain Monte Carlo: Fast sampling by randomness control in irreversible Markov chains

Manon Michel, Alain Durmus, Stéphane Sénécal

英文摘要：

Irreversible and rejection-free Monte Carlo methods, recently developed in Physics under the name Event-Chain and known in Statistics as Piecewise Deterministic Monte Carlo (PDMC), have proven to produce clear acceleration over standard Monte Carlo methods, thanks to the reduction of their random-walk behavior. However, while applying such schemes to standard statistical models, one generally needs to introduce an additional randomization for sake of correctness. We propose here a new class of Event-Chain Monte Carlo methods that reduces this extra-randomization to a bare minimum. We compare the efficiency of this new methodology to standard PDMC and Monte Carlo methods. Accelerations up to several magnitudes and reduced dimensional scalings are exhibited.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Generalized Bouncy Particle Sampler

As a special example of piecewise deterministic Markov process, bouncy particle sampler is a rejection-free, irreversible Markov chain Monte Carlo algorithm and can draw samples from target distribution efficiently. We generalize bouncy particle sampler in terms of its transition dynamics. In BPS, the transition dynamic at event time is deterministic, but in GBPS, it is random. With the help of this randomness, GBPS can overcome the reducibility problem in BPS without refreshement.

2017-06-18stat.CO

Improving the convergence of reversible samplers

In Monte-Carlo methods the Markov processes used to sample a given target distribution usually satisfy detailed balance, i.e. they are time-reversible. However, relatively recent results have demonstrated that appropriate reversible and irreversible perturbations can accelerate convergence to equilibrium. In this paper we present some general design principles which apply to general Markov processes. Working with the generator of Markov processes, we prove that for some of the most commonly used performance criteria, i.e., spectral gap, asymptotic variance and large deviation functionals, samp…

2016-06-09math-phmath.MPmath.PR

Preconditioned Discrete-HAMS：一种二阶不可逆离散采样器

Preconditioned Discrete-HAMS: A Second-order Irreversible Discrete Sampler

针对离散分布采样问题，研究团队提出引入势函数二阶二次近似、结合高斯积分技巧的PDHAMS算法，该算法满足广义细致平衡且对二次势目标分布无拒绝，实验表现优于现有同类方法。

2025-07-31stat.MEstat.ML

Hamiltonian Assisted Metropolis Sampling

Various Markov chain Monte Carlo (MCMC) methods are studied to improve upon random walk Metropolis sampling, for simulation from complex distributions. Examples include Metropolis-adjusted Langevin algorithms, Hamiltonian Monte Carlo, and other recent algorithms related to underdamped Langevin dynamics. We propose a broad class of irreversible sampling algorithms, called Hamiltonian assisted Metropolis sampling (HAMS), and develop two specific algorithms with appropriate tuning and preconditioning strategies. Our HAMS algorithms are designed to achieve two distinctive properties, while using a…

2020-05-17stat.CO

马尔可夫链转移核的几何分配方法

Geometric Allocation Approach for Transition Kernel of Markov Chain

提出一种几何分配方法构建马尔可夫链转移核，最小化平均拒绝率并在许多情况下实现零拒绝，同时支持不可逆转移核，显著降低自相关时间。

2012-07-01cond-mat.stat-mechcs.NAmath-ph

On Irreversible Metropolis Sampling Related to Langevin Dynamics

There has been considerable interest in designing Markov chain Monte Carlo algorithms by exploiting numerical methods for Langevin dynamics, which includes Hamiltonian dynamics as a deterministic case. A prominent approach is Hamiltonian Monte Carlo (HMC), where a leapfrog discretization of Hamiltonian dynamics is employed. We investigate a recently proposed class of irreversible sampling algorithms, called Hamiltonian assisted Metropolis sampling (HAMS), which uses an augmented target density similarly as in HMC, but involves a flexible proposal scheme and a carefully formulated acceptance-re…

2021-06-06cs.NAmath.NAphysics.comp-ph

更多相关论文收起更多论文

Optimal Scaling of the MALA algorithm with Irreversible Proposals for Gaussian targets

It is well known in many settings that reversible Langevin diffusions in confining potentials converge to equilibrium exponentially fast. Adding irreversible perturbations to the drift of a Langevin diffusion that maintain the same invariant measure accelerates its convergence to stationarity. Many existing works thus advocate the use of such non-reversible dynamics for sampling. When implementing Markov Chain Monte Carlo algorithms (MCMC) using time discretisations of such Stochastic Differential Equations (SDEs), one can append the discretization with the usual Metropolis-Hastings accept-rej…

2019-07-01math.PRmath.STstat.ME

基于马尔可夫链蒙特卡罗的复杂模型随机输入抽样

Random Input Sampling for Complex Models Using Markov Chain Monte Carlo

许多随机过程可以模拟为接受随机输入的确定性模型的输出。这种模型通常描述一个复杂的数学或物理随机系统，并且在模型的输入变量中引入随机性。当输出事件的统计信息已知时，必须以特定的方式选择这些输入变量，以使输出具有规定的统计信息。由于输入随机变量的概率分布不是直接已知的，而是由输出随机变量的统计量隐含地指示的，所以这个问题对于经典的抽样方法来说通常是棘手的。基于马尔可夫链蒙特卡罗方法，通过对标准梅特罗波利斯-黑斯廷斯算法的改进，提出了一种新的随机输入采样方法.作为一个例子，我们考虑一个随机微分方程（sde）描述的系统，并演示如何满足这个sde的随机过程的样本路径可以用我们的技术产生。

2012-11-20stat.ML