Multilevel Generative Samplers for Investigating Critical Phenomena
Ankur Singha, Elia Cellini, Kim Andrea Nicoli, Karl Jansen, Stefan Kühn, Shinichi Nakajima
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 128 × 128 two-dimensional Ising systems. SIC also allows us to adopt a specialized sequential training protocol with model transfer, which significantly accelerates training.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3913df89-fac5-482d-b0f8-d3d2d8e61987Builds on4
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- ANTN: Bridging Autoregressive Neural Networks and Tensor Networks for Quantum Many-Body SimulationZhuo Chen, Laker Newhouse, Eddie Chen, Di Luo et al.NeurIPS 2023 · 19 citations
- Universality of Winning Tickets: A Renormalization Group PerspectiveWilliam T. Redman, Tianlong Chen, Zhangyang Wang, Akshunna S. DograICML 2022 · 9 citations
- MS3D: A RG Flow-Based Regularization for GAN Training with Limited DataJian Wang, Xin Lan, Yuxin Tian, Jiancheng LvICML 2024 · 2 citations
Related papers
- Continual Repeated Annealed Flow Transport Monte CarloAlexander G. de G. Matthews, Michael Arbel, Danilo Jimenez Rezende, Arnaud DoucetICML 2022 · 69 citations
- Non-convex Learning via Replica Exchange Stochastic Gradient MCMCWei Deng, Qi Feng, Liyao Gao, Faming Liang et al.ICML 2020 · 54 citations
- Scalable Equilibrium Sampling with Sequential Boltzmann GeneratorsCharlie B. Tan, Joey Bose, Chen Lin, Leon Klein et al.ICML 2025
- Microcanonical Langevin Ensembles: Advancing the Sampling of Bayesian Neural NetworksEmanuel Sommer, Jakob Robnik, Giorgi Nozadze, Uros Seljak et al.ICLR 2025
- Fast Doubly-Adaptive MCMC to Estimate the Gibbs Partition Function with Weak Mixing Time BoundsShahrzad Haddadan, Yue Zhuang, Cyrus Cousins, Eli UpfalNeurIPS 2021 · 9 citations
