Related papers: Heat Bath Efficiency with Metropolis-Type Updating
Markov Chain Monte Carlo (MCMC) methods have a drawback when working with a target distribution or likelihood function that is computationally expensive to evaluate, specially when working with big data. This paper focuses on…
The Rugged Metropolis (RM) algorithm is a biased updating scheme, which aims at directly hitting the most likely configurations in a rugged free energy landscape. Details of the one-variable (RM$_1$) implementation of this algorithm are…
In this paper we introduce a new sampling algorithm which has the potential to be adopted as a universal replacement to the Metropolis--Hastings algorithm. It is related to the slice sampler, and motivated by an algorithm which is…
The density of states is calculated for a SU(2) and a compact U(1) lattice gauge theory using a modified version of the Wang-Landau algorithm. We find that the density of states of the SU(2) gauge theory can be reliably calculated over a…
Poisson log-linear models are ubiquitous in many applications, and one of the most popular approaches for parametric count regression. In the Bayesian context, however, there are no sufficient specific computational tools for efficient…
The recent introduction of machine learning techniques, especially normalizing flows, for the sampling of lattice gauge theories has shed some hope on improving the sampling efficiency of the traditional HMC algorithm. Naive use of…
Monte Carlo (MC) sampling methods are widely applied in Bayesian inference, system simulation and optimization problems. The Markov Chain Monte Carlo (MCMC) algorithms are a well-known class of MC methods which generate a Markov chain with…
The new method of nonperturbative calculation of the beta function in the lattice gauge theory is proposed. The method is based on the finite size scaling hypothesis.
We present an improved Metropolis algorithm for arbitrary hard core systems in any dimensions. In the new updating scheme the conventional Metropolis step of a single particle is replaced by a collective step of a chain of particles. For…
We present a fast adaptive method for the evaluation of heat potentials, which plays a key role in the integral equation approach for the solution of the heat equation, especially in a non-stationary domain. The algorithm utilizes a…
Recently, Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms based on canonical ensemble, which is aimed to overcome slow sampling problems associated with temperature-driven discontinuous phase transitions.…
This paper presents an algorithm for sampling random variables that allows to separation of the sampling process into subproblems by dividing the sample space into overlapping parts. The subproblems can be solved independently of each other…
An energy efficient use of large scale sensor networks necessitates activating a subset of possible sensors for estimation at a fusion center. The problem is inherently combinatorial; to this end, a set of iterative, randomized algorithms…
The renormalization constants present in the lattice evaluation of the topological susceptibility can be non-perturbatively calculated by using the so-called heating method. We test this method for the $O(3)$ non-linear $\sigma$-model in…
We systematically compare filtering methods used to extract topological excitations from lattice gauge configurations. We show that there is a strong correlation of the topological charge densities obtained by APE and Stout smearing.…
We investigate local update algorithms for the fully frustrated XY model on a square lattice. In addition to the standard updating procedures like the Metropolis or heat bath algorithm we include overrelaxation sweeps, implemented through…
Metropolis Hastings nested sampling evolves a Markov chain, accepting new points along the chain according to a version of the Metropolis Hastings acceptance ratio, which has been modified to satisfy the nested sampling likelihood…
The ability to generate samples of the random effects from their conditional distributions is fundamental for inference in mixed effects models. Random walk Metropolis is widely used to perform such sampling, but this method is known to…
Traditional image detail enhancement is local filter-based or global filter-based. In both approaches, the original image is first divided into the base layer and the detail layer, and then the enhanced image is obtained by amplifying the…
The set of nonnegative integer lattice points in a polytope, also known as the fiber of a linear map, makes an appearance in several applications including optimization and statistics. We address the problem of sampling from this set using…