Related papers: Funnel Hopping Monte Carlo: An efficient method to…
An algorithm for separating the high- and low-frequency molecular dynamics modes in Hybrid Monte Carlo simulations of gauge theories with dynamical fermions is presented. The separation is based on splitting the pseudo-fermion action into…
We propose a novel approach called Self-Learning Hybrid Monte Carlo (SLHMC) which is a general method to make use of machine learning potentials to accelerate the statistical sampling of first-principles density-functional-theory (DFT)…
Gaussian Quantum Monte Carlo (GQMC) is a stochastic phase space method for fermions with positive weights. In the example of the Hubbard model close to half filling it fails to reproduce all the symmetries of the ground state leading to…
A path-integral hybrid Monte Carlo approach with enveloping bridging potentials (PIHMC-EBP) is proposed for calculating numerically exact tunneling splittings in molecular systems. The central idea is to construct an approximately…
Tethering methods allow us to perform Monte Carlo simulations in ensembles with conserved quantities. Specifically, one couples a reservoir to the physical magnitude of interest, and studies the statistical ensemble where the total…
We present a Hamiltonian Monte Carlo algorithm to sample from multivariate Gaussian distributions in which the target space is constrained by linear and quadratic inequalities or products thereof. The Hamiltonian equations of motion can be…
A common way to simulate the transport and spread of pollutants in the atmosphere is via stochastic Lagrangian dispersion models. Mathematically, these models describe turbulent transport processes with stochastic differential equations…
We propose a splitting Hamiltonian Monte Carlo (SHMC) algorithm, which can be computationally efficient when combined with the random mini-batch strategy. By splitting the potential energy into numerically nonstiff and stiff parts, one…
We present a new Subset Simulation approach using Hamiltonian neural network-based Monte Carlo sampling for reliability analysis. The proposed strategy combines the superior sampling of the Hamiltonian Monte Carlo method with…
This paper studies a non-random-walk Markov Chain Monte Carlo method, namely the Hamiltonian Monte Carlo (HMC) method in the context of Subset Simulation used for structural reliability analysis. The HMC method relies on a deterministic…
Self-learning Monte Carlo method (SLMC), using a trained effective model to guide Monte Carlo sampling processes, is a powerful general-purpose numerical method recently introduced to speed up simulations in (quantum) many-body systems. In…
We describe an embarrassingly parallel, anytime Monte Carlo method for likelihood-free models. The algorithm starts with the view that the stochasticity of the pseudo-samples generated by the simulator can be controlled externally by a…
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine learning workflows. A ubiquitous problem in machine learning workflows is sampling…
Hamiltonian Monte Carlo (HMC) is widely used for sampling from high dimensional target distributions with densities known up to proportionality. While HMC exhibits favorable scaling properties in high dimensions, it struggles with strongly…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
We introduce an algorithm to systematically improve the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that…
We introduce a general Monte Carlo scheme for achieving atomistic simulations with monoelectronic Hamiltonians including the thermalization of both nuclear and electronic degrees of freedom. The kinetic Monte Carlo algorithm is used to…
In this paper, I investigate more closely the recently proposed Free Energy Monte Carlo algorithm that is devised in particular for calculations where conventional Monte Carlo simulations struggle with ergodicity problems. The simplest…
Variational Monte Carlo is a many-body numerical method that scales well with system size. It has been extended to study the Green function only recently by Charlebois and Imada (2020). Here we generalize the approach to systems with open…
Basin-Hopping (BH) or Monte-Carlo Minimization (MCM) is so far the most reliable algorithms in chemical physics to search for the lowest-energy structure of atomic clusters and macromolecular systems. BH transforms the complex energy…