Pith. sign in

REVIEW 5 cited by

Multilevel Generative Samplers for Investigating Critical Phenomena

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

arxiv 2503.08918 v2 pith:R2AQWOZS submitted 2025-03-11 cs.LG hep-latstat.ML

Multilevel Generative Samplers for Investigating Critical Phenomena

classification cs.LG hep-latstat.ML
keywords generativesamplingcriticalrigcssystemscarlomontesampler
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Investigating critical phenomena or phase transitions is of high interest in physics and chemistry, for which Monte Carlo (MC) simulations, a crucial tool for numerically analyzing macroscopic properties of given systems, are often hindered by an emerging divergence of correlation length -- known as scale invariance at criticality (SIC) in the renormalization group theory. SIC causes the system to behave the same at any length scale, from which many existing sampling methods suffer: long-range correlations cause critical slowing down in Markov chain Monte Carlo (MCMC), and require intractably large receptive fields for generative samplers. In this paper, we propose a Renormalization-informed Generative Critical Sampler (RiGCS) -- a novel sampler specialized for near-critical systems, where SIC is leveraged as an advantage rather than a nuisance. Specifically, RiGCS builds on MultiLevel Monte Carlo (MLMC) with Heat Bath (HB) algorithms, which perform ancestral sampling from low-resolution to high-resolution lattice configurations with site-wise-independent conditional HB sampling. Although MLMC-HB is highly efficient under exact SIC, it suffers from a low acceptance rate under slight SIC violation. Notably, SIC violation always occurs in finite-size systems, and may induce long-range and higher-order interactions in the renormalized distributions, which are not considered by independent HB samplers. RiGCS enhances MLMC-HB by replacing a part of the conditional HB sampler with generative models that capture those residual interactions and improve the sampling efficiency. Our experiments show that the effective sample size of RiGCS is a few orders of magnitude higher than state-of-the-art generative model baselines in sampling configurations for 128x128 two-dimensional Ising systems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The critical slowing down in diffusion models

    cond-mat.dis-nn 2026-05 conditional novelty 8.0

    Diffusion models on the Gaussian O(n) model exhibit critical slowing down with shallow networks that deeper local score approximations can reduce to logarithmic training-time scaling.

  2. Sampling two-dimensional spin systems with transformers

    cond-mat.dis-nn 2026-04 unverdicted novelty 7.0

    Transformer networks sample up to 180x180 2D Ising systems and 64x64 Edwards-Anderson systems by generating spin groups with probability approximations, yielding ~20x higher effective sample size than prior neural sam...

  3. Diffusion Models for Sampling Near Criticality in Lattice Field Theories

    hep-lat 2026-07 accept novelty 6.0

    Fully convolutional diffusion models trained on small lattices transfer to unseen larger volumes for 2D/3D phi^4 sampling across phases, matching or beating same-size training on most observables.

  4. The critical slowing down in diffusion models

    cond-mat.dis-nn 2026-05 unverdicted novelty 6.0

    Diffusion models suffer critical slowing down when sampling near criticality in the O(n) model but deeper local architectures reduce training-time scaling from quadratic to logarithmic in system size.

  5. Variational Autoregressive Networks with probability priors

    cs.LG 2026-05 unverdicted novelty 5.0

    Incorporating probability priors into variational autoregressive networks reduces training burden and enables larger system sizes for sampling in the Ising and Edwards-Anderson models.