Related papers: Comparing the R algorithm and RHMC for staggered f…

We present first, exploratory results of a hybrid Monte-Carlo algorithm for dynamical, n_f=2, four-dimensional QCD with overlap fermions. As expected, the computational requirements are typically two orders of magnitude larger for the…

Close to the chiral limit, many calculations in numerical lattice QCD can potentially be accelerated using low-mode deflation techniques. In this paper it is shown that the recently introduced domain-decomposed deflation subspaces can be…

Considering Ginsparg-Wilson type fermions dynamically in lattice QCD simulations is a challenging task. The hope is to be able to approach smaller pion masses and to eventually reach physical situations. The price to pay is substantially…

We introduce a powerful and flexible MCMC algorithm for stochastic simulation. The method builds on a pseudo-marginal method originally introduced in [Genetics 164 (2003) 1139--1160], showing how algorithms which are approximations to an…

Hamiltonian Monte Carlo (HMC) has become routinely used for sampling from posterior distributions. Its extension Riemann manifold HMC (RMHMC) modifies the proposal kernel through distortion of local distances by a Riemannian metric. The…

We address the locality problem arising in simulations, which take the square root of the staggered fermion determinant as a Boltzmann weight to reduce the number of dynamical quark tastes from four to two. We study analytically and…

I give a status report on the validity of the so-called ``fourth-root trick'', i.e. the procedure of representing the determinant for a single fermion by the fourth root of the staggered fermion determinant. This has been used by the MILC…

In this article, we discuss the optimal allocation problem in an experiment when a regression model is used for statistical analysis. Monotonic convergence for a general class of multiplicative algorithms for $D$-optimality has been…

It has recently been demonstrated in quenched lattice simulations that the distribution of the low-lying eigenvalues of the QCD Dirac operator is universal and described by random-matrix theory. We present first evidence that this…

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…

In this talk I propose a new computational scheme with overlap fermions and a fast algorithm to invert the corresponding Dirac operator.

In QCD chiral symmetry is explicitly broken by quark masses, the effect of which can be described reliably by chiral perturbation theory. Effects of explicit chiral symmetry breaking by the lattice regularisation of the Dirac operator,…

Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we…

Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionisation of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems.…

Hamiltonian Monte Carlo (HMC) algorithms which combine numerical approximation of Hamiltonian dynamics on finite intervals with stochastic refreshment and Metropolis correction are popular sampling schemes, but it is known that they may…

As a prerequisite to dynamical fermion simulations a detailed study of optimal parameters and scaling behavior is conducted for the quenched Schr\"odinger functional at fixed renormalized coupling. We compare standard hybrid overrelaxation…

We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…

We establish epigraphical and uniform laws of large numbers for sample-based approximations of law invariant risk functionals. These sample-based approximation schemes include Monte Carlo (MC) and certain randomized quasi-Monte Carlo…

We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…

A sensible application of the Hybrid Monte Carlo (HMC) method is often hindered by the presence of large - or even infinite - potential barriers. These potential barriers separate the configuration space into distinct sectors and can lead…