Analysis of autocorrelation times in Neural Markov Chain Monte Carlo simulations

11/19/2021
by   Piotr Białas, et al.
0

We provide a deepened study of autocorrelations in Neural Markov Chain Monte Carlo simulations, a version of the traditional Metropolis algorithm which employs neural networks to provide independent proposals. We illustrate our ideas using the two-dimensional Ising model. We propose several estimates of autocorrelation times, some inspired by analytical results derived for the Metropolized Independent Sampler, which we compare and study as a function of inverse temperature β. Based on that we propose an alternative loss function and study its impact on the autocorelation times. Furthermore, we investigate the impact of imposing system symmetries (Z_2 and/or translational) in the neural network training process on the autocorrelation times. Eventually, we propose a scheme which incorporates partial heat-bath updates. The impact of the above enhancements is discussed for a 16 × 16 spin system. The summary of our findings may serve as a guide to the implementation of Neural Markov Chain Monte Carlo simulations of more complicated models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2019

Discussion of "Unbiased Markov chain Monte Carlo with couplings" by Pierre E. Jacob, John O'Leary and Yves F. Atchadé

This is a contribution for the discussion on "Unbiased Markov chain Mont...
research
05/05/2007

MIMO detection employing Markov Chain Monte Carlo

We propose a soft-output detection scheme for Multiple-Input-Multiple-Ou...
research
02/02/2022

Gradient estimators for normalising flows

Recently a machine learning approach to Monte-Carlo simulations called N...
research
07/26/2023

3:1 Nesting Rules in Redistricting

In legislative redistricting, most states draw their House and Senate ma...
research
07/12/2021

Mathematical Analysis of Redistricting in Utah

We investigate the claim that the Utah congressional districts enacted i...
research
11/04/2019

Annotated Hypergraphs: Models and Applications

Hypergraphs offer a natural modeling language for studying polyadic inte...
research
07/24/2021

Nonreversible Markov chain Monte Carlo algorithm for efficient generation of Self-Avoiding Walks

We introduce an efficient nonreversible Markov chain Monte Carlo algorit...

Please sign up or login with your details

Forgot password? Click here to reset