Stochastic Path Sampler For Lattice Field Theory

summary

The gist

In lattice field theory, target distributions are known only up to normalization, while Markov chain Monte Carlo simulations often become inefficient near phase transitions or the continuum limit due…

In short

The Stochastic Path Sampler (SPS) uses two neural networks to learn forward and backward stochastic dynamics between equilibrium states in lattice field theory. By minimizing path-space KL divergence, it achieves sampling quality similar to HMC but with a much shorter autocorrelation time, effectively mitigating critical slowing down near phase transitions.

Key concepts

Stochastic Path Sampler (SPS)
A neural network method that learns the discretized Langevin dynamics paths for both the forward and backward processes in lattice field theory. It trains by minimizing path-space KL divergence to establish a trajectory-level balance between prior and target distributions.
Entropy Production on Path Space
This concept uses the Clausius inequality from thermodynamics to measure irreversibility in stochastic processes. It quantifies the asymmetry between the forward trajectory ensemble and its reversed ensemble, showing how much the process moves away from equilibrium.
Autocorrelation Time
A measure of how long a Markov chain takes to explore its state space effectively. In this work, SPS+IMH showed a significantly lower integrated autocorrelation time (around 0.5) compared to HMC (around 160), demonstrating improved sampling efficiency, especially near critical regions.

Terminology used across episodes

This episode discusses

The paper

Stochastic Path Sampler For Lattice Field Theory · Read on arXiv

Centre for Quantum Fields and Gravity, Swansea University · School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen (CUHKShenzhen) · Johannes Gutenberg University Mainz · School of Mathematical Sciences, Queen Mary University of London

Transcript

Introduction to the show: ident: High Energy Physics: Lattice. The day in lattice field theory: what the simulations put on the table.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "Stochastic Path Sampler For Lattice Field Theory".

Mira: Here's the gist of the paper. In lattice field theory, target distributions are known only up to normalization, while Markov chain Monte Carlo simulations often become inefficient near phase transitions or the continuum limit due to critical slowing down <ref:2606.13790#pg6> The central idea of the SPS is to establish a trajectory-level balance for learnable forward and backward stochastic dynamics between two equilibrium states—the prior and target distributions <ref:2606.13790#pg9> In two-dimensional phi 4 theory, we demonstrate that our neural sampler can achieve the same sampling quality as HMC but with a much shorter autocorrelation time in the pseudocritical region <ref:2606.13790#pg10> This sampler offers a novel stochastic-quantization-inspired route to data-free proposal construction for lattice field theory by leveraging a variational free-energy principle derived from path-space irreversibility <ref:2606.13790#pg5>.

Kai: Nonequilibrium Thermodynamics on Path Space The Clausius inequality provides a mathematical formulation of the Second Law of Thermodynamics, stating that irreversible processes are accompanied by nonnegative entropy production <ref:2606.13790#pg6> In this work, we adopt its stochastic-thermodynamic counterpart, namely entropy production on path space <ref:2606.13790#pg6> For a stochastic process evolving between microscopic configurations, entropy production measures the asymmetry between the forward trajectory ensemble and its corresponding reversed ensemble <ref:2606.13790#pg6> The stochastic entropy production of the system is given by an expression involving the accumulated affinity and a boundary term <ref:2606.13790#pg6> This demonstrates irreversibility of the nonequilibrium system; the larger Σ(τ), the stronger the forward–backward inconsistency, and hence the more irreversible the process <ref:2606.13790#pg6>.

Mira: How the training signal is built The SPS networks are trained by minimizing the path-space KL divergence between the learned forward path measure and the unnormalized backward path measure <ref:2606.13790#pg6> The loss function is defined as LSPS(θ) = EqF

log qθ(sT; τ) − log ˜π∗(sT): <ref:2606.13790#pg6> Since the partition function of the target distribution is not required in Eq.

Kai: (B.18), the SPS can be trained without reference samples from HMC or any other Markov chain sampler <ref:2606.13790#pg6>.

Paper summary: Kai: So we're looking at this paper called "Stochastic Path Sampler For Lattice Field Theory". Basically, they're tackling the problem that in lattice field theory, you usually only know the target distribution up to a normalization constant and the partition function is too hard to calculate directly.

Mira: That’s right. And Markov chain Monte Carlo simulations often get really slow near phase transitions or when you're trying to reach the continuum limit because of this critical slowing down <ref:2606.13790#pg6>. What this paper proposes is a new way to sample that target distribution without needing reference samples from methods like Hybrid Monte Carlo.

Lev: From an engineering standpoint, that's huge because HMC can take forever when you're near those critical points or trying to get very fine details of the physics. We’re talking about making the sampling much faster in those tricky regions <ref:2606.13790#pg6>.

Kai: The core idea they use is based on nonequilibrium thermodynamics, which is a bit outside our usual quantum hardware focus, but it sets up this path-space balance between the prior and the target distribution <ref:2606.13790#pg9>. They claim their Stochastic Path Sampler SPS can achieve sampling quality comparable to HMC in two dimensional phi four theory, but with a much shorter autocorrelation time in the pseudocritical region <ref:2606.13790#pg10>.

Mira: That’s interesting because they are using a variational free-energy principle derived from path-space irreversibility to build their proposal construction, which is a novel route for data free proposal construction in lattice field theory <ref:2606.13790#pg5>. It’s leveraging the fact that entropy production on path space measures the asymmetry between forward and reversed ensembles <ref:2606.13790#pg6>.

Lev: If they can control that path-space KL divergence, which is what they minimize when training the SPS networks, then they are essentially reducing irreversibility in a way that improves sampling efficiency <ref:2606.13790#pg6>. But we need to be careful about how much of that reduction actually translates to usable speed on real hardware <ref:2606.13790#pg8>.

Kai: The results show that for SPS plus an Independence Metropolis–Hastings correction, the integrated autocorrelation time for the absolute magnetization drops from around one hundred sixty in HMC down to about zero point five with this new method <ref:2606.13790#pg6>. That’s a substantial reduction in how much you need to sample to get reliable statistics <ref:2606.13790#pg6>.

Mira: And they also looked at the effective sample size, which is defined as the normalized effective sample size being controlled by the same quantity, sigma squared, which is the variance of the log weights <ref:2606.13790#pg6>. This connects how well you're sampling to a fundamental measure of weight distribution <ref:2606.13790#pg6>.

Lev: But they also found that while the normalized effective sample size shows a deficit that grows linearly with the lattice volume, the acceptance rate deficit in their correction step only grows as the square root of the volume <ref:2606.13790#pg6>. That explains why you can still get decent results even when you increase your lattice size <ref:2606.13790#pg8>.

Kai: So, to recap this paper, they proposed the Stochastic Path Sampler for Lattice Field Theory by using a neural network method based on nonequilibrium thermodynamics to learn the forward and backward paths of the process <ref:2606.13790#pg6>. They train these networks by minimizing the KL divergence in path space, and then they add an Independence Metropolis–Hastings correction step to ensure accuracy <ref:2606.13790#pg8>.

Mira: The main point is that this SPS with the IMH correction reproduces all physical quantities computed by Hybrid Monte Carlo with high accuracy across different phases, including the symmetric phase, the pseudocritical region, and the symmetry broken phase <ref:2606.13790#pg6>.

Lev: It’s a strong claim because it says this method works where traditional methods struggle most—near critical points—and it shows that for real hardware running on larger volumes, the acceptance rate stays relatively high, even with that volume dependence <ref:2606.13790#pg8>.

Kai: The paper also touched on Nelson’s duality relation in the continuous limit, where they show how the learned path-space balance relates to a local relation between forward and backward drifts <ref:2606.13790#pg6>. That’s a nice theoretical connection that isn't immediately obvious <ref:two thousand six hundred six point one three seven nine zero#pg4.

Mira: It suggests the network isn't just learning paths in isolation, but it's learning the integrated path-space balance rather than forcing a pointwise duality between the two drifts <ref:2606.13790#pg6>.

Lev: For someone building error correction hardware, this means we might be able to use these learned dynamics as a guide for constructing more efficient simulation steps, rather than relying purely on the traditional HMC integration scheme <ref:two thousand six hundred six point one three seven nine zero#pg2.

Kai: So the title "Stochastic Path Sampler For Lattice Field Theory" points to a method that uses path integrals and thermodynamics to solve a problem about sampling distributions where you don't know the target distribution well enough to sample directly <ref:two thousand six hundred six point one three seven nine zero#pg1.

Mira: And the implication is that we can get better, faster results from lattice field theory simulations by using these learned dynamics instead of relying solely on existing Markov chain methods <ref:two thousand six hundred six point one three seven nine zero#pg3.

Lev: It’s a practical idea because it's about making the computational cost manageable when you are dealing with complex many-body systems where you can't just take shortcuts <ref:two thousand six hundred six point one three seven nine zero#pg2.

Kai: So, we're seeing a method that uses path space entropy production to guide the training of neural networks for sampling distributions in lattice field theory <ref:two thousand six hundred six point one three seven nine zero#pg5.

Mira: And the main takeaway is that this approach, when combined with the Independence Metropolis–Hastings correction, gives us very accurate results across different physical regimes <ref:two thousand six hundred six point one three seven nine zero#pg6.

Lev: It shows that we can tackle critical slowing down in these simulations by learning a trajectory-level balance between two equilibrium states, which is what the Stochastic Path Sampler is all about <ref:two thousand six hundred six point one three seven nine zero#pg9.

Conclusion: Kai: So we're wrapping up this look at the Stochastic Path Sampler for Lattice Field Theory by Kai and Mira today.

Mira: They used nonequilibrium thermodynamics to build a way to sample those distributions, but they’re focusing on how that path space balance translates into actual sampling efficiency.

Lev: The core idea is learning the forward and backward paths of the process separately, then minimizing a certain divergence between them, which they call the path-space KL divergence.

Kai: It seems like their main achievement is showing that this method can match Hybrid Monte Carlo quality in two dimensional phi four theory, but with a much faster autocorrelation time when you're near phase transitions.

Mira: They’re using an independence metropolis hastings correction step to make sure the results are accurate, and they found that this method works across different phases, including the symmetry broken one.

Lev: The numbers are interesting; their integrated autocorrelation time for absolute magnetization drops from one hundred sixty in HMC down to about zero point five with their SPS plus correction.

Kai: So it’s not just a theoretical trick; they show a tangible speedup in how quickly you get good statistics on the simulation.

Mira: It means that instead of relying solely on traditional Markov chain methods, we might be able to use these learned dynamics to make lattice field theory simulations much more efficient.

Lev: This is important for real hardware because it suggests a path toward constructing more efficient simulation steps based on learning those dynamics rather than just brute force integration.

Kai: And they did look at Nelson’s duality relation in the continuous limit, which connects the learned path-space balance to a local relation between forward and backward drifts.

Mira: That connection is interesting because it shows the network isn't just learning paths; it’s learning a sort of integrated path-space balance.

Lev: It suggests we can use this kind of learned dynamics as a guide for error correction hardware, aiming for better simulation steps.

More episodes

← Home