Variational Renormalization Group (VRG)

• Variational Renormalization Group (VRG) is a framework that applies explicit optimization to select coarse-grained representations while preserving free-energy or related variational criteria.
• It encompasses diverse methods including Kadanoff-style block-spin constructions, bias-potential Monte Carlo, tensor-network truncations, and neural network flows to model complex systems.
• Practical implementations of VRG enhance simulation accuracy and efficiency across equilibrium, disordered, and dynamical systems by minimizing key variational objectives.

Variational Renormalization Group (VRG) denotes a family of renormalization schemes in which the coarse-grained description is selected by an explicit optimization principle rather than by a purely fixed blocking rule. In the literature, this includes Kadanoff-style real-space constructions with auxiliary hidden variables and trace conditions, Monte Carlo renormalization methods based on convex variational functionals, tensor-network algorithms in which effective subspaces or environments are optimized over MPS, PEPS, corner, or boundary ansätze, and neural or information-theoretic multiscale constructions that turn RG-like transformations into tractable variational problems (Mehta et al., 2014, Wu et al., 2017, 0907.2796, Li et al., 2018). The common structure is the same: an RG step is tied to minimizing or maximizing a quantity such as a free-energy difference, a projected Hamiltonian trace, a bias-potential functional, a partition-function density, or a multilevel entropy.

Formulation	Variational object	Representative sources
Real-space/block-spin VRG	Coupling operator $\mathbf T_\lambda$, free-energy difference, trace condition	(Mehta et al., 2014)
Monte Carlo VRG	Bias potential $V$ minimizing a convex functional $\Omega[V]$	(Wu et al., 2017, Wu et al., 2018)
Tensor-network VRG	MPS/PEPS tensors, corner or boundary environments, truncation isometries	(0907.2796, Pizorn et al., 2011, Liu et al., 2022, Song et al., 14 Aug 2025)
Neural/information-theoretic VRG	Normalizing-flow density $q$, hierarchical entropy/KL objectives	(Li et al., 2018, Asadi, 1 Sep 2025)
Adjacent variational RG formalisms	Optimal-transport functionals, RG-improved variational resummation	(Cotler et al., 2022, Câmara et al., 8 Sep 2025)

1. Kadanoff-style variational RG and the hidden-variable construction

The canonical real-space formulation starts from microscopic binary spins $\{v_i\}$, $v_i\in\{\pm 1\}$, distributed according to

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$

with a Hamiltonian expanded in coupling space as

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$

VRG introduces $M<N$ auxiliary binary variables $\{h_j\}$, $V$0, and a variational coupling operator $V$1. The coarse-grained Hamiltonian is then defined by

$V$2

The free-energy criterion is $V$3, and the exact trace condition is

$V$4

This condition is stronger than approximate matching of a few observables: it inserts a normalized hidden-variable factor into the Boltzmann weight and preserves the partition function and free energy exactly (Mehta et al., 2014).

A central later development is the exact model-class mapping between this Kadanoff variational RG and Restricted Boltzmann Machines (RBMs). If the RBM energy is

$V$5

then the dictionary is

$V$6

Under this identification, the RG hidden-spin Hamiltonian equals the RBM hidden marginal Hamiltonian,

$V$7

and exact satisfaction of the trace condition implies

$V$8

The mapping is exact at the level of formal correspondence between model classes, but the practical optimization criteria differ: VRG commonly minimizes $V$9, whereas RBM training minimizes $\Omega[V]$0 (Mehta et al., 2014).

This formulation also fixes a common misconception. The deep-learning correspondence is narrow: it applies to Kadanoff-type variational RG and RBM-based architectures, not to all neural networks or all deep learning. The same source is explicit that stacked RBMs correspond to iterated coarse-graining across scales, but does not claim that all representation learning is literally RG (Mehta et al., 2014).

2. Variational Monte Carlo RG and the bias-potential framework

A distinct but closely related branch of VRG reformulates Monte Carlo renormalization as optimization over a bias potential on coarse variables. For a lattice spin model with

$\Omega[V]$1

the exact coarse-grained Hamiltonian is

$\Omega[V]$2

The variational object is a bias $\Omega[V]$3 chosen so that the biased coarse-spin distribution equals a target distribution $\Omega[V]$4. The convex functional is

$\Omega[V]$5

Its minimizer satisfies

$\Omega[V]$6

and hence $\Omega[V]$7. For constant $\Omega[V]$8, the coarse variables become uncorrelated, and critical slowing down in the coarse degrees of freedom is strongly reduced (Wu et al., 2017).

In practice, one truncates to

$\Omega[V]$9

with gradient and Hessian

$q$0

$q$1

For uniform $q$2, the renormalized couplings are simply

$q$3

This framework was demonstrated on the 2D Ising model, where the biased-ensemble estimates of the leading RG eigenvalues converge well for large lattices and outperform unbiased Monte Carlo on the same timescale (Wu et al., 2017).

The same bias-potential idea extends to quenched disorder. There the microscopic Hamiltonian is sample-dependent,

$q$4

and the RG map induces a flow of the disorder distribution,

$q$5

The bias is again expanded in the operator basis, and one obtains samplewise renormalized couplings through $q$6. The disorder law is parameterized by

$q$7

so linearized RG can be carried out directly in the space of coupling distributions (Wu et al., 2018).

This formulation sharply distinguishes finite-disorder and strong-disorder fixed points. For the 2D dilute Ising model, the critical distribution flows to a finite-width non-Gaussian fixed distribution, and the leading even eigenvalue was found to be

$q$8

to be compared with $q$9 for the pure Ising model. For the random transverse-field Ising chain and the 3D random-field Ising model, the variance of renormalized couplings grows under RG, indicating strong-disorder behavior rather than finite-range closure of the coupling distribution (Wu et al., 2018). A plausible implication is that VRG is especially effective when the renormalized disorder distribution remains describable by short-range coupling correlations.

3. Tensor-network VRG: MPS, PEPS, NRG, and boundary optimization

In tensor-network language, VRG is reformulated as variational optimization over structured low-entanglement state classes. For one-dimensional quantum systems, the fundamental ansatz is the MPS

$\{v_i\}$0

and the variational problem is

$\{v_i\}$1

Fixing all tensors except one yields the local generalized eigenvalue problem

$\{v_i\}$2

In this sense, DMRG is the variational optimization of an MPS manifold, while Wilson NRG can be viewed as a more limited one-way truncation scheme whose retained states already form an MPS. The review literature explicitly presents MPS and PEPS as both ansätze and “variational renormalization group methods” (0907.2796).

The entanglement rationale is encoded in the discarded Schmidt-weight criterion. If $\{v_i\}$3 is the tail of Schmidt eigenvalues across cut $\{v_i\}$4, then there exists an MPS of bond dimension $\{v_i\}$5 with

$\{v_i\}$6

Combined with area-law or logarithmic-entanglement scaling, this provides the approximation-theoretic basis for variational truncation in one dimension and motivates PEPS as the corresponding higher-dimensional extension (0907.2796).

The variational reinterpretation of numerical RG becomes explicit in the “variational numerical renormalization group” construction. If $\{v_i\}$7 is the enlarged Hamiltonian at one NRG step and $\{v_i\}$8 is the isometry selecting the retained subspace, the NRG truncation is equivalent to minimizing

$\{v_i\}$9

This is the sum of retained effective energies. Once that objective is identified, one can sweep over all local MPS tensors, not only the newest one, thereby importing DMRG-style feedback into NRG. The resulting method keeps $v_i\in\{\pm 1\}$0 scaling while substantially improving spectra for both quantum spin chains and the single impurity Anderson model, especially as the logarithmic discretization parameter approaches the continuum limit (Pizorn et al., 2011).

A separate extension carries variational RG ideas into multigrid PDE solvers. “Multigrid Renormalization” represents the solution on progressively finer dyadic grids by an MPS-like tensor train, truncates to a maximum bond dimension $v_i\in\{\pm 1\}$1, and optimizes tensors by alternating local updates “in the spirit of alternating least squares.” Under the empirical assumptions that $v_i\in\{\pm 1\}$2 remains nearly independent of level and the number of sweeps scales mildly, the overall cost becomes $v_i\in\{\pm 1\}$3, and the method was demonstrated on nonlinear Schrödinger ground states up to $v_i\in\{\pm 1\}$4 grid points in three dimensions (Lubasch et al., 2018). This is not standard statistical-mechanics VRG, but it is a direct transplantation of variational renormalization ideas into numerical analysis.

Boundary and environment optimization produce a further tensor-network branch. In variational CTMRG, the fixed-point environment of an infinite 2D tensor network is reformulated as the bilevel optimization problem

$v_i\in\{\pm 1\}$5

The solution corresponds to the conventional CTMRG fixed-point environment, but the route to it is explicitly variational. This reformulation yields high-precision residual entropy for the dimer model and accurate critical points and exponents in Ising, Potts, and clock models (Liu et al., 2022).

In “variational boundary based tensor network renormalization group,” the truncation isometries themselves are optimized against a variationally computed global boundary environment. The common objective is

$v_i\in\{\pm 1\}$6

with update

$v_i\in\{\pm 1\}$7

By using a VUMPS boundary MPS in canonical form, the method retains TRG-like $v_i\in\{\pm 1\}$8 scaling while improving free-energy accuracy over HOTRG, HOSRG, CTM-TRG, and BWTRG at the same bond dimension. The authors are equally clear that, because short-range loop entanglement is not removed, scaling dimensions and central charges remain unstable in the same sense as in TRG/HOTRG (Song et al., 14 Aug 2025). This sharply separates variational environment optimization from full entanglement-filtering RG.

4. Neural and information-theoretic reformulations

A more recent line of work recasts VRG as explicit probabilistic modeling. In “Neural Network Renormalization Group,” the variational object is a normalized density $v_i\in\{\pm 1\}$9 induced by an invertible flow $$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$0 from a Gaussian prior $$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$1. Exact change of variables gives

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$2

and the training functional is

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$3

Because

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$4

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$5 is a variational upper bound on the physical free energy. The architecture uses disentanglers and decimators, interprets inference $$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$6 as RG flow and generation $$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$7 as inverse RG flow, and gives direct access to an exact latent-space energy

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$8

The construction is multiscale and RG-inspired, but not a Wilsonian semigroup: the maps are invertible, and the learned coarse variables need not coincide with conventional block spins (Li et al., 2018).

An adjacent but distinct information-theoretic generalization is “hierarchical maximum entropy via the renormalization group.” Here one fixes a tower of deterministic coarse-graining maps

$$P(\{v_i\})=\frac{e^{-{\mathbf H}(\{v_i\})}}{Z},\qquad Z=\mathrm{Tr}_{v_i}e^{-{\mathbf H}(\{v_i\})},$$9

and optimizes a weighted multilevel entropy

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$0

The resulting generalized Gibbs principle is

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$1

In invariant families, this yields explicit “parameter flows” analogous to RG flows. For nearest-neighbor Ising loss with decimation, the effective coupling obeys

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$2

This is not canonical Kadanoff VRG, since the coarse-graining maps are fixed and deterministic rather than variationally learned, but it shows how multiscale variational principles can generate exact RG-like recursions in probability space (Asadi, 1 Sep 2025).

These reformulations suggest a broader interpretation of VRG: the “variational” content can reside in free-energy bounds, exact likelihood models, multilevel KL objectives, or Pareto-optimal entropy tradeoffs, not only in hidden-spin kernels. That suggestion is interpretive, but it is strongly supported by the coexistence of these constructions.

5. Open-system dynamics and constructive field-theoretic variants

VRG also appears in settings far from equilibrium and far from finite-dimensional spin blocking. In dissipative spin-cavity systems, the density matrix obeys

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$3

The method vectorizes $${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$4 into a superket $${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$5, performs Schmidt truncation in Liouville space,

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$6

and updates the compressed basis adaptively during Suzuki–Trotter sweeps. The local evolution factors are

$${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$7

and the truncation is chosen from the dominant eigenvectors of reduced superoperators. This time-adaptive VRG was used to simulate mesoscopic ensembles up to $${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$8 spins and to show periodic pulses of nonclassical light with $${\mathbf H}[\{v_i\}] = -\sum_i K_i v_i - \sum_{ij} K_{ij} v_i v_j - \sum_{ijk} K_{ijk} v_i v_j v_k + \ldots.$$9 at the emission peaks (Dhar et al., 2018). Here “variational RG” refers to optimal low-rank compression of an evolving open-system superoperator state, not to equilibrium coarse-graining of a partition function.

A very different rigorous usage appears in Balaban-style constructive RG for lattice non-linear sigma models. The blocked transform is

$M<N$0

so for fixed coarse field $M<N$1 one must solve the constrained minimization of the action $M<N$2 under the block-average constraint. In the sigma-model adaptation, the result is a unique minimal configuration in the small-field regime, and that minimizer becomes the classical background field for steepest-descent analysis of the fluctuation integral (Goswami, 2022). The minimizer is written in multiplicative form,

$M<N$3

where $M<N$4 solves a fixed-point equation derived from the constrained Euler–Lagrange problem. This is a precise variational RG in the sense of a constrained classical minimization inside one RG step; it is not an approximate numerical truncation scheme.

These examples broaden the scope of VRG in two orthogonal directions. The dissipative spin-cavity method shows that variational compression can be applied directly to Lindbladian time evolution in superoperator space (Dhar et al., 2018). The constructive sigma-model work shows that the “variational problem” can mean the exact constrained saddle configuration required to define a background field for rigorous multiscale integration (Goswami, 2022).

6. Terminological breadth, misconceptions, and adjacent nonstandard uses

The term “variational RG” is not uniform across the literature, and several nearby constructions are explicitly not standard VRG. One recurrent source of confusion is exact or continuous RG written in variational form. In the optimal-transport reformulation of exact RG, Polchinski/Wegner–Morris flow becomes

$M<N$5

and admits a JKO-type minimizing-movement discretization (Cotler et al., 2022). This is genuinely variational, but not Kadanoff-style VRG with hidden block variables.

Likewise, “Gradient flow and the renormalization group” studies a self-consistent gradient-flow evolution in which the flowed field is driven by the effective action $M<N$6 rather than the bare action. The central equation is

$M<N$7

After a field redefinition restoring canonical normalization, the resulting local-potential approximation reproduces Gaussian and Wilson–Fisher eigenvalues at $M<N$8. However, the same source is explicit that this is not variational RG in the usual block-spin sense and contains no explicit variational principle or hidden-variable construction (Abe et al., 2018).

A further terminological divergence occurs in finite-temperature field theory. In “Scale dependence improvement of the quartic scalar field thermal effective potential in the optimized perturbation theory,” the authors call

$M<N$9

their “Variational Renormalization Group” framework, applying it to thermal $\{h_j\}$0 theory and emphasizing improved renormalization-scale stability of the effective potential, pressure, and critical temperature (Câmara et al., 8 Sep 2025). This use of “VRG” is explicitly unrelated to the tensor-network or Kadanoff/block-spin traditions.

Several distinctions are therefore essential.

First, free-energy preservation is not the same as full-distribution matching. In Kadanoff-style VRG, the exact trace condition preserves the partition function/free energy, whereas in RBM language the natural objective is $\{h_j\}$1; they coincide only in the exact case (Mehta et al., 2014).

Second, variational truncation is not the same as full disentangling RG. Boundary-optimized tensor methods such as VBTRG improve the projector by using a global environment, but without entanglement filtering they do not stabilize conformal data at criticality (Song et al., 14 Aug 2025).

Third, not every “RG–deep learning” analogy is a claim about all neural networks. The exact mapping established in the RBM setting is narrower and more formal than blanket statements about deep learning as RG (Mehta et al., 2014).

Taken together, these distinctions show that VRG is best treated as a technically plural notion. In one branch it is a hidden-variable coarse-graining theory with trace conditions; in another it is a convex Monte Carlo inverse problem for renormalized Hamiltonians; in another it is variational tensor optimization over low-entanglement manifolds or boundary environments; and in adjacent fields it can denote exact-RG variational flows or RG-improved variational resummation. The unifying idea is the replacement of a fixed RG step by an optimization problem, but the optimized object and the meaning of “renormalization” vary substantially across contexts.