REVIEW 2 cited by
Testing trivializing maps in the Hybrid Monte Carlo algorithm
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
Testing trivializing maps in the Hybrid Monte Carlo algorithm
read the original abstract
We test a recent proposal to use approximate trivializing maps in a field theory to speed up Hybrid Monte Carlo simulations. Simulating the CP^{N-1} model, we find a small improvement with the leading order transformation, which is however compensated by the additional computational overhead. The scaling of the algorithm towards the continuum is not changed. In particular, the effect of the topological modes on the autocorrelation times is studied.
Forward citations
Cited by 2 Pith papers
-
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.
-
Bounding statistical errors in lattice field theory simulations
Introduces bounds-based stopping criteria and automatic windowing for autocorrelation integrals to estimate statistical errors in lattice field theory Monte Carlo simulations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.