Hierarchical Local Kernel Renormalization

• Hierarchical local kernel renormalization is a framework that recursively composes local kernels across scales to form effective coarse-level representations.
• It leverages locality in data—whether patchwise or axis-wise—by recursively integrating kernel interactions in CNNs, regression, and graph models.
• This method enhances computational efficiency and feature learning by systematically reducing high-dimensional interactions to low-dimensional effective parameters.

Hierarchical local kernel renormalization denotes, in the cited literature, a family of multilevel constructions in which a local kernel, local transfer map, or local effective interaction is recursively composed across dimensions, spatial patches, graph generations, or network layers. The phrase is used most explicitly for finite-width convolutional networks, where patchwise kernel components are renormalized by learned matrix-valued order parameters (Baglioni et al., 28 May 2026), but closely related mechanisms also appear in nested kernel regression on structured grids (Mohamadipanah et al., 2017), in recursive connectivity kernels on hierarchical graphs (Nogawa, 2017), and in local-kernel geometric and probabilistic frameworks (Berry et al., 2014, Bény, 2013). The common ingredients are locality, a hierarchy of effective descriptions, and a renormalization step that replaces lower-level structure by an effective kernel, coefficient field, or transfer operator at the next level.

1. Conceptual scope

The cited works suggest that hierarchical local kernel renormalization is not a single standardized formalism, but a family of related constructions. In some cases, the kernel is a conventional positive-definite similarity function used for regression or Gaussian-process limits. In others, it is a local connectivity map, a Schur-complement update, or a local stochastic map. The hierarchy may run over input dimensions, network depth, graph generations, or geometric scales. “Renormalization” may be literal, as in real-space RG on hierarchical graphs, or structural, as in recursive replacement of detailed interactions by effective low-dimensional couplings.

Three recurring notions organize the literature. Locality refers to interactions that are confined to a coordinate axis, a spatial patch, a finite graph cell, or a bounded causal cone. Hierarchy refers to recursive composition across levels: adjacent dimensions in structured regression, successive layers in deep networks, nested graph generations in percolation and spectral RG, or multiscale lattices in generative models. Renormalization refers to the passage from fine variables to effective parameters, whether by explicit fixed-point recursion, Schur complements, kernel normalization, or learned order parameters.

Setting	Local object	Hierarchical mechanism
Structured kernel regression	Axis-wise kernel coefficients	Dimension-by-dimension nesting
CNN finite-width theory	Patch-pair kernels $K_{\mu\nu}^{ij}$	Layer-wise local renormalization
Percolation and hierarchical graphs	Cell connectivity map $R(z,p)$ or rooted transfer map $F$	Generation-by-generation recursion
Geometric and generative models	Local kernels or local stochastic maps	Scale-indexed operators

A recurrent source of ambiguity is that “local” does not mean the same thing in every setting. In D-KRLS, locality is axis-wise and enters through one-dimensional kernels along each coordinate (Mohamadipanah et al., 2017). In finite-width CNN theory, locality is patchwise and depends on weight sharing (Aiudi et al., 2023). In Berry–Sauer’s local-kernel geometry, locality means exponential concentration in tangent-space coordinates and convergence to a local drift-diffusion operator (Berry et al., 2014). In pointed hierarchical graphs, locality is rooted-subgraph locality: the finite-generation subunit together with its distinguished roots is the renormalized block (Nogawa, 2017).

2. Mathematical motifs

A large fraction of the literature can be organized around three mathematical templates. The first is recursive effective-kernel substitution, where a large kernel model is replaced by a sequence of smaller kernel models, each defined on a lower-complexity object. The second is local transfer recursion, where a finite-dimensional summary of a block is propagated by a map such as $z_{n+1}=R(z_n,p)$ or $H_{n+1}=F(g_n,H_n)$. The third is operator normalization, where row-normalization, density correction, or Schur complementation removes nuisance factors and exposes an effective generator or coarse operator.

In the most explicit local-renormalization formulation for neural networks, the effective kernel becomes data dependent through a learned matrix acting on local kernel components. For shallow CNNs, the renormalized kernel is

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$

so finite width selects and mixes patch-pair contributions $K_{\mu\nu}^{ij}$ rather than merely rescaling a global kernel (Aiudi et al., 2023). For deep Bayesian CNNs in the proportional regime, the corresponding renormalization is hierarchical across layers: $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$ with $\mathcal Q$ assembled from layerwise positive-definite factors and $(\Theta\circ\omega)^L$ denoting repeated nonlinear and patch-aggregation updates (Baglioni et al., 28 May 2026).

By contrast, in planar percolation and pointed hierarchical graphs, the renormalized object is not a Mercer kernel but a local connectivity probability or generating-function transfer rule. The recursion

$R(z,p)$0

coarse-grains the left-to-right connectivity of a finite cell into an effective bond (Baek et al., 2011). In pointed hierarchical graphs, rooted connectivity probabilities and root-cluster generating functions satisfy

$R(z,p)$1

and the Jacobian of $R(z,p)$2 defines a combining matrix whose largest eigenvalue controls cluster growth and singularity type (Nogawa, 2017).

3. Dimension-wise hierarchical kernel constructions

The paper "Hierarchic Kernel Recursive Least-Squares" (Mohamadipanah et al., 2017) gives a direct example of hierarchical kernelization on structured multidimensional data. Its target setting is evenly distributed multidimensional datasets indexed by coordinates such as space and time, with $R(z,p)$3 samples along each axis. Instead of building one kernel model on the full Cartesian product, the method reorganizes the regression into a nested sequence of kernel regressions over successive dimensions. The central rule is that the weights learned along one dimension are themselves modeled as functions of the adjacent dimension.

In the 2D case, the method first fits, for each fixed $R(z,p)$4, a kernel model over $R(z,p)$5,

$R(z,p)$6

collects the coefficient vectors into a matrix $R(z,p)$7, and then treats each row of $R(z,p)$8 as a scalar function over $R(z,p)$9. This yields a second kernel model

$F$0

so that the surface is represented as a nested coefficient field rather than a single joint kernel expansion. The same pattern extends to 3D and higher dimensions, where coefficient matrices are vectorized and modeled again over the next axis. The general training rule is

$F$1

for the base level, and

$F$2

for higher levels, where the target of one regression is the weight object learned at the previous level (Mohamadipanah et al., 2017).

Its computational relevance is immediate on product grids. Standard KRLS on the full joint input scales as

$F$3

whereas the hierarchical decomposition scales as

$F$4

For equal axis sizes $F$5, the dominant exponent drops from $F$6 to $F$7. The paper emphasizes that this saving is achieved without input-space sparsification and without discarding support points. At the same time, it explicitly does not derive classical recursive least-squares updates; the objectives presented are unregularized least-squares problems solved in a hierarchical batch decomposition (Mohamadipanah et al., 2017).

A related but distinct construction appears in "Hierarchically Compositional Kernels for Scalable Nonparametric Learning" (Chen et al., 2016). There the base kernel is preserved exactly within leaf domains, while cross-domain interactions are replaced by Nyström couplings attached to internal nodes of a partition tree. The one-level prototype is

$F$8

The full hierarchical kernel recursively composes such couplings via node-specific landmark sets $F$9. The resulting kernel remains positive-definite, preserves exact local covariance within leaves, and yields memory and arithmetic costs $z_{n+1}=R(z_n,p)$0 and $z_{n+1}=R(z_n,p)$1, respectively (Chen et al., 2016). This suggests a renormalization-like replacement of long-range interactions by progressively coarser effective representatives, although the paper formulates it as a kernel construction rather than an RG.

4. Local kernel renormalization in neural networks

The shallow-network distinction between fully connected and convolutional architectures is central to the contemporary usage of local kernel renormalization. In "Local Kernel Renormalization as a mechanism for feature learning in overparametrized Convolutional Neural Networks" (Aiudi et al., 2023), one-hidden-layer FC networks in the proportional regime $z_{n+1}=R(z_n,p)$2 with $z_{n+1}=R(z_n,p)$3 fixed admit only a global kernel renormalization: $z_{n+1}=R(z_n,p)$4 Here $z_{n+1}=R(z_n,p)$5 is a single scalar saddle-point parameter, so every pair of training examples is renormalized by the same factor. The finite-width FC predictor can therefore be reproduced by an infinite-width kernel machine with suitably retuned Gaussian prior.

For one-hidden-layer CNNs, the situation is different because the kernel is spatially resolved. The local covariance

$z_{n+1}=R(z_n,p)$6

compares patch $z_{n+1}=R(z_n,p)$7 of example $z_{n+1}=R(z_n,p)$8 with patch $z_{n+1}=R(z_n,p)$9 of example $H_{n+1}=F(g_n,H_n)$0, and the corresponding local kernel $H_{n+1}=F(g_n,H_n)$1 enters the renormalized predictor through a full matrix $H_{n+1}=F(g_n,H_n)$2. Because weight sharing couples locations, off-diagonal patch interactions $H_{n+1}=F(g_n,H_n)$3 survive and finite width can amplify, suppress, or mix patch-pair contributions in a data-dependent manner. The paper identifies $H_{n+1}=F(g_n,H_n)$4 as a learned “feature matrix” and argues that this local matrix renormalization is the mechanism by which shallow overparameterized CNNs, unlike shallow FC networks or locally connected networks without weight sharing, can realize effective feature learning (Aiudi et al., 2023).

"Kernel Renormalization in Bayesian Deep Neural Networks: the Equivalent Wishart Ansatz in the Proportional Regime" (Baglioni et al., 28 May 2026) extends this logic to deep Bayesian MLPs and CNNs. For MLPs, the paper introduces an Equivalent Wishart Ansatz for the hierarchy of empirical kernels. The resulting large-deviation theory reduces finite-width effects to $H_{n+1}=F(g_n,H_n)$5 scalar order parameters $H_{n+1}=F(g_n,H_n)$6, with renormalized kernel

$H_{n+1}=F(g_n,H_n)$7

The effective action is

$H_{n+1}=F(g_n,H_n)$8

This preserves the shape of the deep NNGP kernel while renormalizing its amplitude.

For CNNs, however, the order parameter is no longer scalar. The relevant object is a stacked patch-and-sample covariance matrix, and the finite-width renormalization acts on its patch blocks. The local aggregation map $H_{n+1}=F(g_n,H_n)$9 averages empirical kernels over receptive fields, and repeated application of $\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$0 produces a layerwise hierarchy of local kernels. The final renormalized kernel is

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$1

with

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$2

Here the renormalization is both local, because it acts on patch-patch kernel components, and hierarchical, because the patchwise order parameters compose across depth (Baglioni et al., 28 May 2026). In the cited literature, this is the most literal realization of the phrase “hierarchical local kernel renormalization.”

5. Renormalization on hierarchical and planar graphs

In statistical-physics applications, hierarchical local kernel renormalization is often literal real-space RG. "Hierarchical renormalization-group study on the planar bond-percolation problem" (Baek et al., 2011) treats a local cell as a finite kernel of connectivity. Given bare bond probability $\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$3 and previously renormalized effective bond probability $\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$4, the recursion

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$5

is defined as the probability that the cell connects its left boundary to its right boundary. For the triangular lattice at width $\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$6,

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$7

while for honeycomb and square lattices at width $\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$8,

$\left[{K}_{\textrm{CNN}^{(\mathrm{R})} ({\bar Q})\right]_{\mu\nu} = \frac{1}{\lambda_1\lfloor N_0/S \rfloor}\sum_{ij} \bar Q_{ij} K_{\mu\nu}^{ij},$9

The fixed-point condition $K_{\mu\nu}^{ij}$0 together with $K_{\mu\nu}^{ij}$1 yields lower bounds or exact thresholds, depending on the lattice. The same recursion supplies the heuristic estimate $K_{\mu\nu}^{ij}$2 via $K_{\mu\nu}^{ij}$3 (Baek et al., 2011).

"Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs" (Nogawa, 2017) generalizes this to rooted graph sequences $K_{\mu\nu}^{ij}$4 built from finitely many copies of $K_{\mu\nu}^{ij}$5. The local state is the rooted connectivity pattern $K_{\mu\nu}^{ij}$6, and the renormalized quantities are the root-connectivity probabilities $K_{\mu\nu}^{ij}$7 and root-cluster generating functions $K_{\mu\nu}^{ij}$8: $K_{\mu\nu}^{ij}$9 Linearizing $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$0 with respect to $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$1 yields a combining matrix $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$2, and its largest eigenvalue determines the local fractal exponent

$$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$3

The order parameter obeys

$$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$4

The paper then relates the singularity of $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$5 to the bifurcation type of the RG fixed point and to whether the first-order perturbation of the largest eigenvalue vanishes. A sufficient condition for that vanishing is the combination of simply-backbone-connectedness and tight-root-connection (Nogawa, 2017).

A complementary exact RG appears in "Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks" (Boettcher et al., 2015). There the renormalized object is the shifted Laplacian kernel $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$6, represented as a Gaussian quadratic form. Decimating odd sites yields exact recursion relations for a finite set of local kernel parameters $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$7, $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$8, and $$K^{(\mathrm R)}_{\mathcal Q} = \frac{1}{N_{p_L}} \sum_{i,j=1}^{N_{p_L}} \mathcal Q_{ij}\, \big[(\Theta\circ\omega)^L(C)\big]_{ji},$$9. For the HN3/HN5 class, for example,

$\mathcal Q$0

with analogous recursions for higher-level couplings. The determinant then factorizes into a multiplicative RG prefactor and a final finite block, providing asymptotics for spanning-tree growth and spectral quantities (Boettcher et al., 2015).

In "Renormalization Group Analysis of the Hierarchical Anderson Model" (Soosten et al., 2016), the renormalization step is an exact Schur-complement elimination of antisymmetric modes in dyadic pairs. The local potential update is

$\mathcal Q$1

while the hierarchical hopping operator simply shifts $\mathcal Q$2. The fine-scale resolvent kernel is expressed exactly in terms of the coarse resolvent kernel and local random factors, and repeated iteration drives the model into an effective high-disorder regime under the stated non-concentration criterion (Soosten et al., 2016). In this setting, the “kernel” being renormalized is the operator kernel of the resolvent itself.

6. Geometry, generative models, and computational analogues

Berry–Sauer’s "Local Kernels and the Geometric Structure of Data" (Berry et al., 2014) gives the most explicit continuum theory of local kernels. A local kernel satisfies

$\mathcal Q$3

and its low-order moments define local mass $\mathcal Q$4, drift $\mathcal Q$5, and diffusion tensor $\mathcal Q$6. The kernel integral operator

$\mathcal Q$7

admits the expansion

$\mathcal Q$8

with

$\mathcal Q$9

Left-normalization by $(\Theta\circ\omega)^L$0 isolates the generator,

$(\Theta\circ\omega)^L$1

while symmetrization yields a Laplace–Beltrami operator for the induced metric

$(\Theta\circ\omega)^L$2

This is not a hierarchical construction by itself, but it provides the exact local normalization machinery on which a multiscale renormalization scheme could be built (Berry et al., 2014).

"Deep learning and the renormalization group" (Bény, 2013) reinterprets MERA as a classical probabilistic generative model, CORA, built from local stochastic maps

$(\Theta\circ\omega)^L$3

Each $(\Theta\circ\omega)^L$4 is decomposed into local stochastic maps, and each layer can only create correlations at its own scale. Under the assumption that the target distribution is fully characterized by local correlations, local marginals can be computed explicitly in time of order

$(\Theta\circ\omega)^L$5

for an $(\Theta\circ\omega)^L$6-site marginal. In probabilistic language, these local stochastic maps are Markov kernels. The paper therefore supplies a clean hierarchical-local kernel architecture, although it is presented as inverse RG rather than kernel renormalization (Bény, 2013).

A more computational analogue appears in "A hierarchical random compression method for kernel matrices" (Chen et al., 2018). There the hierarchy is a block-cluster tree, locality is geometric separation, and admissible far-field blocks satisfy

$(\Theta\circ\omega)^L$7

Admissible blocks are compressed by randomized low-rank sampling, near-field blocks are recursively refined, and the full method achieves $(\Theta\circ\omega)^L$8 complexity. The paper explicitly frames this as hierarchical low-rank kernel compression rather than RG. The distinction matters. A blockwise compression hierarchy can replace fine interactions by effective far-field approximations, but it does not automatically supply fixed points, flow equations, or scale-dependent coupling laws (Chen et al., 2018).

That distinction also clarifies several common misconceptions. Not every multilevel kernel method is a renormalization scheme. D-KRLS recursively parameterizes kernel weights rather than renormalizing kernels in the strict RG sense (Mohamadipanah et al., 2017). The shallow CNN theory identifies local kernel renormalization, but it is not hierarchical across depth (Aiudi et al., 2023). HRCM is hierarchical and locality-aware, but its relation to renormalization is mainly analogical (Chen et al., 2018). Conversely, the deep Bayesian CNN theory does provide an explicit hierarchical local kernel renormalization mechanism, but only within the proportional-width posterior formalism defined in that paper (Baglioni et al., 28 May 2026). The literature therefore supports the term most strongly when three ingredients coexist: a genuinely local kernel object, a recursive hierarchy of updates, and an effective coarse description whose parameters are learned or propagated across levels.