Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.28580

Renormalization-guided inverse blocking for lattice field generation: construction and validation

Anna Hasenfratz A, Ethan T. Neil, Letizia Parato, Noah Schwartz

Published Aug 28, 2026• 5 citations
arXivHTMLPDF

Abstract

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. The blocking is separated into an invertible smoothing transformation followed by decimation. Machine learning, in the form of a conditional normalizing flow, is used to reconstruct the short-distance degrees of freedom removed by the decimation. A short fine-action rethermalization then removes the residual mismatch. Because the coarse ensemble supplies the long-distance modes, the same blocking transformation and conditional flow can be reused recursively on larger lattices, producing a cascade of configurations from an initial small-volume ensemble. We test the method in two-dimensional $ϕ^4$ theory with $λ=1$ at criticality and demonstrate stable cascade upscaling from $16^2$ to $2048^2$ lattices on local computational resources. Controlled rethermalization tests show that short-distance mismatches relax rapidly, whereas a deliberately introduced mismatch in the relevant thermal direction relaxes much more slowly. The construction uses ingredients that admit natural extensions to higher-dimensional systems and, ultimately, to gauge and fermionic degrees of freedom.

DOI
10.48550/arxiv.2608.28580

Related papers

Renormalization-guided cascade upscaling for lattice field generation

Anna Hasenfratz A, Ethan T. Neil, Letizia Parato +1 more

We introduce a renormalization-group (RG) guided machine-learning algorithm for lattice field generation based on approximate inversion of an RG transformation. A ``perfect blocking'' construction supplies equilibrated long-distance modes, while a conditional normalizing flow reconstructs short-distance details and brief rethermalization removes residual errors. In 2D $ϕ^4$ theory at criticality, a flow trained at $L\le32$ is reused recursively in cascades reaching $L=2048$ with correct long-distance physics.

arXiv:2608.28581•Aug 28, 2026•6 citations

Exact and Near-Exact Inverse Renormalization Group with Constrained Monte Carlo

Dimitrios Bachtis

We establish conditions for exactness of the inverse renormalization group via constrained Markov processes, a class of Monte Carlo simulations which sample the degrees of freedom within a block on a fine lattice under the constraint that they remain consistent with the corresponding degree of freedom on the coarse lattice according to a forward renormalization group transformation. We show analytically, for an arbitrary transformation, that constrained Markov processes correspond to an exact inversion of the renormalization group at the fixed point action, and to a near-exact inversion in the vicinity of the fixed point. We then optimize renormalization group transformations directly on inversely renormalized configurations to effectively map the action onto itself and ensure computational stability in the generation of configurations for high-dimensional systems. Starting from a set of uncorrelated configurations for the three-dimensional $ϕ^{4}$ quantum field theory at lattice volume $V=16^{3}$, we invert the renormalization group with constrained Monte Carlo to construct a set of uncorrelated, near-equilibrium configurations for $V=128^{3}$ and extract two critical exponents of the system. The inversion exhibits no critical slowing down, with dynamic critical exponent $z=0.03(2)$.

arXiv:2611.07641•Nov 5, 2026•0 citations

Generating configurations of increasing lattice size with machine learning and the inverse renormalization group

Dimitrios Bachtis

We review recent developments of machine learning algorithms pertinent to the inverse renormalization group, which was originally established as a generative numerical method by Ron-Swendsen-Brandt via the implementation of compatible Monte Carlo simulations. Inverse renormalization group methods enable the iterative generation of configurations for increasing lattice size without the critical slowing down effect. We discuss the construction of inverse renormalization group transformations with the use of convolutional neural networks and present applications in models of statistical mechanics, lattice field theory, and disordered systems. We highlight the case of the three-dimensional Edwards-Anderson spin glass, where the inverse renormalization group can be employed to construct configurations for lattice volumes that have not yet been accessed by dedicated supercomputers.

arXiv:2405.16288•European network for Particle physics, Lattice field theory and Extreme computing Conference (EuroPLEx)•Jun 3, 2024•2 citations

Inverse renormalization group of spin glasses

Dimitrios Bachtis

We propose inverse renormalization group transformations to construct approximate configurations for lattice volumes that have not yet been accessed by supercomputers or large-scale simulations in the study of spin glasses. Specifically, starting from lattices of volume $V={8}^{3}$ in the case of the three-dimensional Edwards-Anderson model we employ machine learning algorithms to construct rescaled lattices up to ${V}^{\ensuremath{'}}={128}^{3}$, which we utilize to extract two critical exponents. We conclude by discussing how to incorporate numerical exactness within inverse renormalization group methods of disordered systems, thus opening up the opportunity to explore a sustainable and energy-efficient generation of exact configurations for increasing lattice volumes without the use of dedicated supercomputers.

arXiv:2310.12631•Physical review. B./Physical review. B•Oct 29, 2024•5 citations

Dreaming up scale invariance via inverse renormalization group

Adam Rançon, Ulysse Rançon, Tomislav Ivek +1 more

We explore how minimal neural networks can invert the renormalization group (RG) coarse-graining procedure in the two-dimensional Ising model, effectively dreaming up microscopic configurations from coarse-grained states. This task, formally impossible at the level of configurations, can be approached probabilistically, allowing machine-learning models to reconstruct scale-invariant distributions without relying on microscopic input. We demonstrate that even neural networks with as few as three trainable parameters can learn to generate critical configurations, reproducing the scaling behavior of observables such as magnetic susceptibility, heat capacity, and Binder ratios. A real-space renormalization group analysis of the generated configurations confirms that the models capture not only scale invariance but also reproduce nontrivial eigenvalues of the RG transformation. While the inversion is necessarily imperfect, these minimal models robustly reproduce the RG-relevant structure of the critical distribution. Surprisingly, we find that increasing network complexity by introducing multiple layers offers no significant benefit. These findings suggest that simple local rules, akin to those generating fractal structures, are sufficient to encode the universality of critical phenomena, creating an opportunity for efficient generative models of statistical ensembles in physics.

arXiv:2506.04016•Physical review. E•Apr 2, 2026•1 citation

Inverse Renormalization Group in Quantum Field Theory

Dimitrios Bachtis, Gert Aarts A, Francesco Di Renzo +1 more

We propose inverse renormalization group transformations within the context of quantum field theory that produce the appropriate critical fixed point structure, give rise to inverse flows in parameter space, and evade the critical slowing down effect in calculations pertinent to criticality. Given configurations of the two-dimensional ϕ^{4} scalar field theory on sizes as small as V=8^{2}, we apply the inverse transformations to produce rescaled systems of size up to V^{'}=512^{2} which we utilize to extract two critical exponents. We conclude by discussing how the approach is generally applicable to any method that successfully produces configurations from a statistical ensemble and how it can give novel insights into the structure of the renormalization group.

arXiv:2107.00466•Physical Review Letters•Feb 23, 2022•40 citations
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. The blocking is separated into an invertible smoothing transformation followed by decimation. Machine learning, in the form of a conditional normalizing flow, is used to reconstruct the short-distance degrees of freedom removed by the decimation. A short fine-action rethermalization then removes the residual mismatch. Because the coarse ensemble supplies the long-distance modes, the same blocking transformation and conditional flow can be reused recursively on larger lattices, producing a cascade of configurations from an initial small-volume ensemble. We test the method in two-dimensional ϕ4ϕ^4ϕ4 theory with λ=1λ=1λ=1 at criticality and demonstrate stable cascade upscaling from 16216^2162 to 204822048^220482 lattices on local computational resources. Controlled rethermalization tests show that short-distance mismatches relax rapidly, whereas a deliberately introduced mismatch in the relevant thermal direction relaxes much more slowly. The construction uses ingredients that admit natural extensions to higher-dimensional systems and, ultimately, to gauge and fermionic degrees of freedom.
We introduce a renormalization-group (RG) guided machine-learning algorithm for lattice field generation based on approximate inversion of an RG transformation. A ``perfect blocking'' construction supplies equilibrated long-distance modes, while a conditional normalizing flow reconstructs short-distance details and brief rethermalization removes residual errors. In 2D ϕ4ϕ^4ϕ4 theory at criticality, a flow trained at L≤32L\le32L≤32 is reused recursively in cascades reaching L=2048L=2048L=2048 with correct long-distance physics.
We establish conditions for exactness of the inverse renormalization group via constrained Markov processes, a class of Monte Carlo simulations which sample the degrees of freedom within a block on a fine lattice under the constraint that they remain consistent with the corresponding degree of freedom on the coarse lattice according to a forward renormalization group transformation. We show analytically, for an arbitrary transformation, that constrained Markov processes correspond to an exact inversion of the renormalization group at the fixed point action, and to a near-exact inversion in the vicinity of the fixed point. We then optimize renormalization group transformations directly on inversely renormalized configurations to effectively map the action onto itself and ensure computational stability in the generation of configurations for high-dimensional systems. Starting from a set of uncorrelated configurations for the three-dimensional ϕ4ϕ^{4}ϕ4 quantum field theory at lattice volume V=163V=16^{3}V=163, we invert the renormalization group with constrained Monte Carlo to construct a set of uncorrelated, near-equilibrium configurations for V=1283V=128^{3}V=1283 and extract two critical exponents of the system. The inversion exhibits no critical slowing down, with dynamic critical exponent z=0.03(2)z=0.03(2)z=0.03(2).
We review recent developments of machine learning algorithms pertinent to the inverse renormalization group, which was originally established as a generative numerical method by Ron-Swendsen-Brandt via the implementation of compatible Monte Carlo simulations. Inverse renormalization group methods enable the iterative generation of configurations for increasing lattice size without the critical slowing down effect. We discuss the construction of inverse renormalization group transformations with the use of convolutional neural networks and present applications in models of statistical mechanics, lattice field theory, and disordered systems. We highlight the case of the three-dimensional Edwards-Anderson spin glass, where the inverse renormalization group can be employed to construct configurations for lattice volumes that have not yet been accessed by dedicated supercomputers.
We propose inverse renormalization group transformations to construct approximate configurations for lattice volumes that have not yet been accessed by supercomputers or large-scale simulations in the study of spin glasses. Specifically, starting from lattices of volume V=83V={8}^{3}V=83 in the case of the three-dimensional Edwards-Anderson model we employ machine learning algorithms to construct rescaled lattices up to ${V}^{\ensuremath{'}}={128}^{3}$, which we utilize to extract two critical exponents. We conclude by discussing how to incorporate numerical exactness within inverse renormalization group methods of disordered systems, thus opening up the opportunity to explore a sustainable and energy-efficient generation of exact configurations for increasing lattice volumes without the use of dedicated supercomputers.
We explore how minimal neural networks can invert the renormalization group (RG) coarse-graining procedure in the two-dimensional Ising model, effectively dreaming up microscopic configurations from coarse-grained states. This task, formally impossible at the level of configurations, can be approached probabilistically, allowing machine-learning models to reconstruct scale-invariant distributions without relying on microscopic input. We demonstrate that even neural networks with as few as three trainable parameters can learn to generate critical configurations, reproducing the scaling behavior of observables such as magnetic susceptibility, heat capacity, and Binder ratios. A real-space renormalization group analysis of the generated configurations confirms that the models capture not only scale invariance but also reproduce nontrivial eigenvalues of the RG transformation. While the inversion is necessarily imperfect, these minimal models robustly reproduce the RG-relevant structure of the critical distribution. Surprisingly, we find that increasing network complexity by introducing multiple layers offers no significant benefit. These findings suggest that simple local rules, akin to those generating fractal structures, are sufficient to encode the universality of critical phenomena, creating an opportunity for efficient generative models of statistical ensembles in physics.
We propose inverse renormalization group transformations within the context of quantum field theory that produce the appropriate critical fixed point structure, give rise to inverse flows in parameter space, and evade the critical slowing down effect in calculations pertinent to criticality. Given configurations of the two-dimensional ϕ^{4} scalar field theory on sizes as small as V=8^{2}, we apply the inverse transformations to produce rescaled systems of size up to V^{'}=512^{2} which we utilize to extract two critical exponents. We conclude by discussing how the approach is generally applicable to any method that successfully produces configurations from a statistical ensemble and how it can give novel insights into the structure of the renormalization group.