Learning Trivializing Flows
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:L5D3IXXBrecord.jsonopen to challenge →
read the original abstract
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 Hybrid Monte Carlo (HMC) algorithm. In this work we study a modified HMC algorithm that draws on the seminal work on trivializing flows by L\"uscher. Autocorrelations are reduced by sampling from a simpler action that is related to the original action by an invertible mapping realised through Normalizing Flows models with a minimal set of training parameters. We test the algorithm in a $\phi^{4}$ theory in 2D where we observe reduced autocorrelation times compared with HMC, and demonstrate that the training can be done at small unphysical volumes and used in physical conditions. We also study the scaling of the algorithm towards the continuum limit under various assumptions on the network architecture.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Testing machine-learned distributions against Monte Carlo data for the QCD chiral phase transition
Conditional MAFs interpolate QCD chiral phase structure across coupling, mass, and volume, reproducing reweighting while cutting required ensembles despite bias near transitions.
-
Scaling flow-based approaches for topology sampling in $\mathrm{SU}(3)$ gauge theory
Out-of-equilibrium simulations with open-to-periodic boundary switching plus a tailored stochastic normalizing flow enable efficient topology sampling in the continuum limit of four-dimensional SU(3) Yang-Mills theory.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.