Related papers: Learning Trivializing Flows
We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…
Continuous normalizing flows are known to be highly expressive and flexible, which allows for easier incorporation of large symmetries and makes them a powerful computational tool for lattice field theories. Building on previous work, we…
The Field-Transformation Hybrid Monte-Carlo (FTHMC) algorithm potentially mitigates the issue of critical slowing down by combining the HMC with a field transformation, originally proposed by L\"{u}scher and motivated as trivializing the…
Continuous normalizing flows (CNFs) learn the probability path between a reference distribution and a target distribution by modeling the vector field generating said path using neural networks. Recently, Lipman et al. (2022) introduced a…
The two dimensional O(3) sigma model, just as quantum chromodynamics, is an asymptotically free theory with a mass gap. Therefore, it is an interesting and simple toy model to investigate algorithms for Markov Chain Monte Carlo simulations…
Recent advances in MCMC use normalizing flows to precondition target distributions and enable jumps to distant regions. However, there is currently no systematic comparison of different normalizing flow architectures for MCMC. As such, many…
We propose a generic construction of Lie group agnostic and gauge covariant neural networks, and introduce constraints to make the neural networks continuous differentiable and invertible. We combine such neural networks and build gauge…
We present the learned harmonic mean estimator with normalizing flows - a robust, scalable and flexible estimator of the Bayesian evidence for model comparison. Since the estimator is agnostic to sampling strategy and simply requires…
Critical slowing down, where autocorrelation grows rapidly near the continuum limit due to Hybrid Monte Carlo (HMC) moving through configuration space inefficiently, still challenges lattice gauge theory simulations. Combining neural field…
We introduce a Hamiltonian Monte Carlo (HMC) methodology based on a randomized selection of integration times, referred to as eHMC, where "e" stands for empirical. The approach relies on an offline calibration phase that leverages…
The hybrid Monte Carlo (HMC) algorithm is a ubiquitous method in computational physics with applications ranging from condensed matter to lattice QCD and beyond. However, HMC simulations often suffer from long autocorrelation times,…
We present a simple, sophisticated method to capture renormalization group flow in Monte Carlo simulation, which provides important information of critical phenomena. We applied the method to $D=3,4$ lattice $\phi^4$ model and obtained…
Critical slowing down and topological freezing severely hinder Monte Carlo sampling of lattice field theories as the continuum limit is approached. Recently, significant progress has been made in applying a class of generative machine…
Bayesian reasoning in linear mixed-effects models (LMMs) is challenging and often requires advanced sampling techniques like Markov chain Monte Carlo (MCMC). A common approach is to write the model in a probabilistic programming language…
Normalizing flows model a complex target distribution in terms of a bijective transform operating on a simple base distribution. As such, they enable tractable computation of a number of important statistical quantities, particularly…
We introduce a variant of the Hybrid Monte Carlo (HMC) algorithm to address large-deviation statistics in stochastic hydrodynamics. Based on the path-integral approach to stochastic (partial) differential equations, our HMC algorithm…
We propose a formally valid machine-learning-assisted global proposal mechanism for Monte Carlo sampling in lattice gauge theory. The construction is based on a coupling-flow update on the SU(2) lattice-link manifold, in which active links…
We report on a study of the autocorrelation times of the local version of the Hybrid Monte Carlo (LHMC) algorithm for pure gauge $SU(3)$. We compare LHMC to standard multi-hit Metropolis and to the global version of the same HMC. For every…
Hamiltonian systems with multiple timescales arise in molecular dynamics, classical mechanics, and theoretical physics. Long-time numerical integration of such systems requires resolving fast dynamics with very small time steps, which…
We propose a novel machine learning method for sampling from the high-dimensional probability distributions of Lattice Field Theories, which is based on a single neural ODE layer and incorporates the full symmetries of the problem. We test…