Grokking is a delayed transition from memorization to generalization in deep neural networks (NNs). We examine whether scaling and renormalization group (RG) theories can describe this dynamics, establishing a quantitative physical framework for neural generalization transitions. For modular addition on a two-layer NN, an ensemble of trained models defines an order parameter (the squared weight norm) and fluctuation proxies for the heat capacity and the susceptibility, with training epoch and weight decay serving as thermal and field control coordinates. To bridge neural architectures to real-space RG, we construct an exact coupling matrix via a second-order expansion of the loss with respect to per-neuron norms and use its Fiedler vector to define an effective geometry. This spectral ordering yields a monotonic spatial decay of coupling strength that is absent under random permutations. We then execute real-space RG by block-spin aggregating adjacent neurons and parameterizing the coupling matrix into off-diagonal band strengths. Linearizing this local RG map yields relevant scaling exponents and five derived critical exponents, with direct empirical estimates matching RG predictions within 1-10%. Overall, our framework provides a consistent effective description of grokking, suggesting the scaling and renormalization group formalism as a tool to investigate NN dynamics.
Abstract The behavior of
b=2 b = 2 real-space renormalization group (RSRG) maps like the majority rule and the decimation map was examined by numerically applying RSRG steps to critical
q=2,3,4 q = 2 , 3 , 4 Potts spin configurations. While the majority rule is generally believed to work well, a more thorough investigation of the action of the map has yet to be considered in the literature. When fixing the size of the renormalized lattice
Lg L g and allowing the source configuration size
L0 L 0 to vary, we observed that the RG flow of the spin and energy correlation under the majority rule map appear to converge to a nontrivial model-dependent curve. We denote this property as “faithfulness”, because it implies that some information remains preserved by RSRG maps that fall under this class. Furthermore, we show that
b=2 b = 2 weighted majority-like RSRG maps acting on the
q=2 q = 2 Potts model can be divided into two categories, maps that behave like decimation and maps that behave like the majority rule.