Related papers: Towards reduction of autocorrelation in HMC by mac…
We present the preliminary tests on two modifications of the Hybrid Monte Carlo (HMC) algorithm. Both algorithms are designed to travel much farther in the Hamiltonian phase space for each trajectory and reduce the autocorrelations among…
The hybrid Monte Carlo (HMC) algorithm is a ubiquitous method in computational physics with applications ranging from condensed matter to lattice QCD and beyond. However, HMC simulations often suffer from long autocorrelation times,…
The recent introduction of Machine Learning techniques, especially Normalizing Flows, for the sampling of lattice gauge theories has shed some hope on improving the sampling efficiency of the traditional Hybrid Monte Carlo (HMC) algorithm.…
We investigate the properties of the Hybrid Monte-Carlo algorithm (HMC) in high dimensions. HMC develops a Markov chain reversible w.r.t. a given target distribution $\Pi$ by using separable Hamiltonian dynamics with potential $-\log\Pi$.…
The analysis developed by L\"uscher and Schaefer of the Hybrid Monte Carlo (HMC) algorithm is extended to include Fourier acceleration. We show for the $\phi^4$ theory that Fourier acceleration substantially changes the structure of the…
We present a modification of the Hybrid Monte Carlo algorithm for tackling the critical slowing down of generating Markov chains of lattice gauge configurations towards the continuum limit. We propose a new method to exchange information…
Monte Carlo simulations of quantum field theories on a lattice become increasingly expensive as the continuum limit is approached since the cost per independent sample grows with a high power of the inverse lattice spacing. Simulations on…
A Markov chain update scheme using a machine-learned flow-based generative model is proposed for Monte Carlo sampling in lattice field theories. The generative model may be optimized (trained) to produce samples from a distribution…
We propose a modification of the Hybrid Monte Carlo (HMC) algorithm that overcomes the topological freezing of a two-dimensional $U(1)$ gauge theory with and without fermion content. This algorithm includes reversible jumps between…
We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field…
We report on a study of the autocorrelation times of the local version of the Hybrid Monte Carlo (LHMC) algorithm for pure gauge $SU(3)$. We compare LHMC to standard multi-hit Metropolis and to the global version of the same HMC. For every…
Simulations of strongly interacting lattice field theories are typically performed using Markov chain Monte Carlo algorithms. Therefore estimators of statistical errors must incorporate the effect of autocorrelations by integrating the…
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) approach that exhibits favourable exploration properties in high-dimensional models such as neural networks. Unfortunately, HMC has limited use in large-data regimes and…
We propose a hybrid Monte Carlo (HMC) technique applicable to high-dimensional multivariate normal distributions that effectively samples along chaotic trajectories. The method is predicated on the freedom of choice of the HMC momentum…
Hamiltonian Monte Carlo (HMC) is a powerful Markov chain Monte Carlo (MCMC) algorithm for estimating expectations with respect to continuous un-normalized probability distributions. MCMC estimators typically have higher variance than…
In lattice quantum field theory studies, parameters defining the lattice theory must be tuned toward criticality to access continuum physics. Commonly used Markov chain Monte Carlo (MCMC) methods suffer from critical slowing down in this…
We compare the performance of the Kramers Equation Monte Carlo (KMC) Algorithm with that of the Hybrid Monte Carlo (HMC) algorithm for numerical simulations with dynamical Kogut-Susskind fermions. Using the lattice Gross-Neveu model in 2…
Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time…
We discuss Hamiltonian Monte Carlo (HMC) and event-chain Monte Carlo (ECMC) for the one-dimensional chain of particles with harmonic interactions and benchmark them against local reversible Metropolis algorithms. While HMC achieves…
We analyze the autocorrelations for the LHMC algorithm in the context of free field theory. In this case this is just Adler's overrelaxation algorithm. We consider the algorithm with even/odd, lexicographic, and random updates, and show…