Related papers: Backpropagating Hybrid Monte Carlo algorithm for f…
Lattice Monte Carlo calculations of interacting systems on non-bipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to…
The Multilevel Monte Carlo method is an efficient variance reduction technique. It uses a sequence of coarse approximations to reduce the computational cost in uncertainty quantification applications. The method is nowadays often considered…
Recently, a new method, based on stochastic integration on the surfaces of steepest descent of the action, was introduced to tackle the sign problem in quantum field theories. We show how this method can be used in many body theories to…
This paper introduces a new Monte Carlo algorithm to invert large matrices. It is based on simultaneous coupled draws from two random vectors whose covariance is the required inverse. It can be considered a generalization of a previously…
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…
We introduce a variant of the Hybrid Monte Carlo (HMC) algorithm to address large-deviation statistics in stochastic hydrodynamics. Based on the path-integral approach to stochastic (partial) differential equations, our HMC algorithm…
Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the…
We present the first practical Monte Carlo calculations of the recently proposed Lefschetz thimble formulation of quantum field theories. Our results provide strong evidence that the numerical sign problem that afflicts Monte Carlo…
It is sometimes speculated that the sign problem that afflicts many quantum field theories might be reduced or even eliminated by choosing an alternative domain of integration within a complexified extension of the path integral (in the…
We present a novel reweighting technique to calculate the relative weights in the Lefschetz thimble decomposition of a path integral. Our method is put to work using a $U(1)$ one-link model providing for a suitable testing ground and…
The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…
We propose a fast stochastic Hamilton Monte Carlo (HMC) method, for sampling from a smooth and strongly log-concave distribution. At the core of our proposed method is a variance reduction technique inspired by the recent advance in…
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…
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 article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…
We present two diagrammatic Monte Carlo methods for quantum systems coupled with harmonic baths, whose dynamics are described by integro-differential equations. The first approach can be considered as a reformulation of Dyson series, and…
We present a concise way to calculate force for Hybrid Monte Carlo with improved actions using the fact that changes in thin and smeared link matrices lie in their respective tangent vector spaces. Since hypercubic smearing schemes are very…
Hamiltonian Monte Carlo (HMC) improves the computational efficiency of the Metropolis algorithm by reducing its random walk behavior. Riemannian Manifold HMC (RMHMC) further improves HMC's performance by exploiting the geometric properties…
We introduce a method that uses the Cauchy-Crofton formula and a new curvature formula from integral geometry to reweight the sampling probabilities of Metropolis-within-Gibbs algorithms in order to increase their convergence speed. We…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…