Related papers: A Finite Baryon Density Algorithm
We investigate the attractive Fermi polaron problem in two dimensions using non-perturbative Monte Carlo simulations. We introduce a new Monte Carlo algorithm called the impurity lattice Monte Carlo method. This algorithm samples the path…
Most Markov chain Monte Carlo methods operate in discrete time and are reversible with respect to the target probability. Nevertheless, it is now understood that the use of non-reversible Markov chains can be beneficial in many contexts. In…
QCD at non-zero chemical potential ($\mu$) for quark number has a complex fermion determinant and thus standard simulation methods for lattice QCD cannot be applied. We therefore simulate this theory using the Complex-Langevin algorithm…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
Efficient approximation lies at the heart of large-scale machine learning problems. In this paper, we propose a novel, robust maximum entropy algorithm, which is capable of dealing with hundreds of moments and allows for computationally…
Monte Carlo simulations of finite density systems are often plagued by the complex action problem. We point out that there exists certain non-commutativity in the zero chemical potential limit and the thermodynamic limit when one tries to…
We discuss differences and similarities between variational Monte Carlo approaches that use conventional and artificial neural network parameterizations of the ground-state wave function for systems of fermions. We focus on a relatively…
We consider penalized regression models under a unified framework where the particular method is determined by the form of the penalty term. We propose a fully Bayesian approach that incorporates both sparse and dense settings and show how…
There has been much recent progress in the understanding and reduction of the computational cost of the Hybrid Monte Carlo algorithm for Lattice QCD as the quark mass parameter is reduced. In this letter we present a new solution to this…
We establish the first mathematically rigorous link between Bayesian, variational Bayesian, and ensemble methods. A key step towards this it to reformulate the non-convex optimisation problem typically encountered in deep learning as a…
Belief updating in Bayes nets, a well known computationally hard problem, has recently been approximated by several deterministic algorithms, and by various randomized approximation algorithms. Deterministic algorithms usually provide…
We simulate lattice QCD with two flavors of Wilson fermions at imaginary baryon chemical potential. Results for the baryon number density computed in the confining and deconfining phases at imaginary baryon chemical potential are used to…
The study of ultracold optically trapped atoms has opened new vistas in the physics of correlated quantum systems. Much attention has now turned to mixtures of bosonic and fermionic atoms. A central puzzle is the disagreement between the…
We develop the no-propagate algorithm for sampling the linear response of random dynamical systems, which are non-uniform hyperbolic deterministic systems perturbed by noise with smooth density. We first derive a Monte-Carlo type formula…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is that the pseudo-fermion action is split into two parts. We test…
Sequential Monte Carlo methods have been a major breakthrough in the field of numerical signal processing for stochastic dynamical state-space systems with partial and noisy observations. However, these methods still present certain…
The probability density function (PDF) associated with a given set of samples is approximated by a piecewise-linear polynomial constructed with respect to a binning of the sample space. The kernel functions are a compactly supported basis…
UKQCD's dynamical fermion project uses the Generalised Hybrid Monte-Carlo (GHMC) algorithm to generate QCD gauge configurations for a non-perturbatively O(a) improved Wilson action with two degenerate sea-quark flavours. We describe our…
We present a study of the finite density lattice Thirring model in 1+1 dimensions using the world-line/fermion-bag algorithm. The model has features similar to QCD and provides a test case for exploring the accuracy of various methods of…
We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel…