REVIEW 1 cited by
Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Cost of the Generalised Hybrid Monte Carlo Algorithm for Free Field Theory
read the original abstract
We study analytically the computational cost of the Generalised Hybrid Monte Carlo (GHMC) algorithm for free field theory. We calculate the Metropolis acceptance probability for leapfrog and higher-order discretisations of the Molecular Dynamics (MD) equations of motion. We show how to calculate autocorrelation functions of arbitrary polynomial operators, and use these to optimise the GHMC momentum mixing angle, the trajectory length, and the integration stepsize for the special cases of linear and quadratic operators. We show that long trajectories are optimal for GHMC, and that standard HMC is more efficient than algorithms based on Second Order Langevin Monte Carlo (L2MC), sometimes known as Kramers Equation. We show that contrary to naive expectations HMC and L2MC have the same volume dependence, but their dynamical critical exponents are z = 1 and z = 3/2 respectively.
Forward citations
Cited by 1 Pith paper
-
Enhanced Sampling Techniques for Lattice Gauge Theory
Metadynamics bias potentials and volume-extrapolation strategies reduce integrated autocorrelation times of topological charge in lattice gauge theories.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.