We investigate generative diffusion models as denoising samplers for two- and three-dimensional lattice $\phi^4$ theory across the symmetric, near-critical, and broken phases. Validated against ensembles generated by Fourier-accelerated HMC combined with Wolff cluster updates, the reverse-SDE sampler reproduces scalar observables and the momentum-space propagator $G(|k|)$, with residual bias concentrated in the zero-mode and, in three dimensions, the action density. We introduce two local diagnostics and an HMC-referenced effective sample size (ESS), which probe the learned drift directly, through a Metropolis-adjusted Langevin acceptance rate, and through observable-level bias and variance. Exploiting a fully convolutional architecture with weights shared across different volumes ($V=L^D$), we show that cross-volume training transfers to unseen sizes, matching or slightly improving in-distribution training in the two-dimensional symmetric and broken phases. A three-dimensional model trained on $L \in \{4, 8, 16, 32\}$ reproduces the propagator and most scalar observables at the unseen lattice size $L = 64$ across the phase diagram, with the residual susceptibility excess in the broken phase as the main exception, and improves several critical observables relative to in-distribution $L = 64$ training. This establishes cross-volume generalization as a viable mechanism for large-volume sampling, and the score learned from many cheap small-lattice configurations transfers to the target volume without retraining.
This work develops a generative counterpart to the theory of benign overfitting and algorithmic regularization for overparameterized neural networks in the supervised lazy-training regime by studying denoising score matching in a vector-valued reproducing kernel Hilbert space with an inner-product kernel.
Hugo Latourelle-Vigeant, Sinho Chewi, Aram-Alexandre Pooladian et al.· 1 citation· ⚡1
This analysis transfers reverse-time discretization errors to the forward corruption law and treats two numerical schemes within a common framework, which identifies a local error, accumulates it through the forward evolution, and inserts the result into a common KL decomposition.
The simple Ising model provides a rich environment to build and study lattice field theories. As part of an ongoing project to construct a conformal field theory (CFT) on an arbitrarily curved manifold, in this work we develop methods to measure the critical temperature $\beta_c$ of the affine-transformed Ising model o...
Kai Svenson, George T. Fleming, Richard C. Brower et al.· 0 citations
Cluster algorithms, such as the Swendsen--Wang and Wolff methods, are among the most successful MCMC methods for mitigating critical slowing down in statistical systems. These constructive cluster algorithms, however, fail in the presence of even extremely weak frustration. Here, we sidestep this fundamental limitation...
G. Bandini, Giulio Biroli, Patrick Charbonneau et al.· 1 citation
We propose an algorithm for generating lattice field configurations based on the approximate inversion of a renormalization-group blocking transformation. We optimize the blocking transformation using a ``perfect blocking''condition so that the blocked lattice distribution is well approximated by a simple coarse action...
A. Hasenfratz, E. T. Neil, L. Parato et al.· 2 citations
To get good performance for two-dimensional site percolation developping a supervised, scale-shared neural architecture, it is key that the learned latent representation exhibits critical fluctuations and scale-dependent flows consistent with the renormalization-group structure of percolation.
Anaclara Alvez, L. Camagna, S. Chibbaro et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.