REVIEW 1 cited by
Learning Trivializing Flows
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
Scaling of Stochastic Normalizing Flows in $\mathrm{SU}(3)$ lattice gauge theory
First demonstration that Stochastic Normalizing Flows inherit the linear-with-volume scaling of non-equilibrium MCMC in 4D SU(3) lattice gauge theory, with a factor-of-two efficiency gain.
Discussion (0). Continue with ORCID to comment.