Reducing autocorrelation times in lattice simulations with generative adversarial networks
Short autocorrelation times are essential for a reliable error assessment in Monte Carlo simulations of lattice systems. A generative adversarial network (GAN) can provide independent samples, thereby eliminating autocorrelations in the Markov chain. We address the question of statistical accuracy b...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) Chapter/Article |
| Language: | English |
| Published: |
8 Nov 2018
|
| In: |
Arxiv
|
| Online Access: | Verlag, Volltext: http://arxiv.org/abs/1811.03533
|
| Author Notes: | Julian M. Urban and Jan M. Pawlowski |
| Summary: | Short autocorrelation times are essential for a reliable error assessment in Monte Carlo simulations of lattice systems. A generative adversarial network (GAN) can provide independent samples, thereby eliminating autocorrelations in the Markov chain. We address the question of statistical accuracy by implementing GANs as an overrelaxation step, incorporated into a traditional hybrid Monte Carlo algorithm. This allows for a sensible numerical assessment of ergodicity and consistency. Results for scalar $\phi^4$-theory in two dimensions are presented. We achieve a significant reduction of autocorrelations while accurately reproducing the correct statistics. We discuss possible improvements as well as solutions to persisting issues and outline strategies towards the application to gauge theory and critical slowing down. |
|---|---|
| Item Description: | Gesehen am 14.12.2018 |
| Physical Description: | Online Resource |