Why Neural Scaling Laws Exist: A Spectral RG Derivation

Empirical scaling laws say that loss falls as a power of parameters, data, and compute. The spectral-RG view explains why: training drives each layer toward a compatible spectral fixed surface; perturbations relax exponentially in RG time; and RG time grows logarithmically with resources. Exponentials in RG time therefore appear as power laws in resource space.

Research draft: Charles H. Martin, PhD, Calculation Consulting, July 2026  ·  Related: A Spectral Renormalization-Group View of Learning

Main claim:

Neural scaling laws are the macroscopic signature of finite-resource approach to a joint layerwise spectral fixed manifold. The fitted loss exponents are set by the slowest irrelevant spectral modes that remain visible to the loss. Exact or near marginality makes this approach unusually slow and produces logarithmic corrections, crossover, and drifting effective exponents.


1 · The Theory in One Pass

Conventional scaling laws directly relate resource counts to terminal loss:

\[ L(P,D)=L_{\infty}+A P^{-p}+B D^{-q}+\cdots, \qquad C\simeq \chi P D. \]

Here, P is total trainable parameter count, D is the amount of effective independent training data, and C is total training compute. These are external control parameters. They do not uniquely specify what the network learned.

Control parameters

P, D, C, optimizer, data mix

Layerwise spectral state

{ρℓ(λ), αℓ, ECSℓ, Tr log X̃ᴿ, Aℓ, Φᴷ, …}

Observable

L, error, transfer, robustness

The spectral-RG theory inserts the missing internal state. Resources determine how far the layer spectra travel toward their fixed surfaces; the resulting spectral state determines the observable loss.

\[ (P,D,C;\Pi)\longrightarrow \mathsf S(t)\longrightarrow L(t), \] Π denotes architecture, optimizer, schedule, regularization, tokenizer, and data distribution.

2 · Controls Versus State Variables

For a matrix-like layer ℓ with weights \(W_\ell\), define the layer correlation operator

\[ X_\ell=\frac{1}{N_\ell}W_\ell^{\mathsf T}W_\ell. \]

The eigenvalues of \(X_\ell\) describe the gains assigned to learned directions, while the empirical spectral density records how those gains are distributed. A useful layer state is

\[ \mathsf S_\ell= \left\{ \widehat\rho_{\ell,R}(\lambda),\, \alpha_\ell,\, \mathcal R_{\mathrm{ECS},\ell},\, T_{R,\ell},\, A_\ell,\, \Phi_{K,\ell},\, M_{\mathrm{tr},\ell},\ldots \right\}. \]
State variableInterpretation
ρ̂ℓ,ᴿ(λ)The normalized retained empirical spectral density; the most complete layerwise state variable in this construction.
αℓThe fitted or local heavy-tail exponent, with the candidate scale-balanced boundary near αℓ ≈ 2.
ℛᴱᶜˢ,ℓThe retained Effective Correlation Space: the spectral sector carrying learned correlations after weak-noise decimation.
Tᴿ,ℓ = Tr log X̃ᴿ,ℓThe retained log-volume coordinate. The ERG gauge condition is Tᴿ,ℓ ≈ 0.
AℓAlignment between the independently selected ECS boundary and the fitted heavy-tail boundary.
Φᴷ,ℓThe fraction of retained spectral energy carried by the largest K modes; a dominant-tail burden.
Mₜᵣ,ℓAn effective participation count for the modes carrying trace or spectral energy.

The full network state is the coupled collection

\[ \mathsf S=\{\mathsf S_1,\mathsf S_2,\ldots,\mathsf S_L\}. \]

The distinction that matters:

P, D, and C are control coordinates. The spectra and their low-dimensional diagnostics are state coordinates. A resource law that omits the state can be predictive, but it cannot by itself explain which internal organization produced the prediction.


3 · Each Layer May Have Its Own Fixed Point

A multilayer network does not need one universal raw-matrix fixed point. Each layer may approach its own normalized retained spectral endpoint,

\[ \mathcal F_\ell^{\star}: \quad \alpha_\ell^{\star}\simeq 2, \qquad T_{R,\ell}^{\star}\simeq 0, \qquad \mathcal R_{\mathrm{ECS},\ell}^{\star}\simeq \mathcal T_{\mathrm{PL},\ell}^{\star}, \]

with a layer-specific retained shape, scale-fixed log volume, dominant-mode burden, and coupling to neighboring layers. The network endpoint is therefore a compatible joint manifold

\[ \mathcal F^{\star}_{\mathrm{net}} \subseteq \mathcal F_1^{\star}\times\mathcal F_2^{\star}\times\cdots\times\mathcal F_L^{\star}. \]

Compatibility matters: an isospectral rotation that is redundant inside one layer need not be redundant for the full network unless adjacent layers transform consistently or the network function is unchanged.

3.1 · Linearized spectral flow

Expand each layer state around its endpoint using spectral scaling operators \(\mathcal O_{\ell a}\):

\[ \delta\mathsf S_\ell =\mathsf S_\ell-\mathsf S_\ell^{\star} =\sum_a z_{\ell a}\,\mathcal O_{\ell a}. \]

Near the joint fixed manifold, the resource-scale RG flow is linear to leading order:

\[ \frac{d z_{\ell a}}{d\tau} =-\omega_{\ell a}z_{\ell a}+O(z^2), \qquad z_{\ell a}(\tau)\sim e^{-\omega_{\ell a}\tau}. \]

Stable irrelevant modes have \(\omega_{\ell a}>0\). Small \(\omega_{\ell a}\) means slow convergence. An exactly marginal linear direction has \(\omega_{\ell a}=0\) and must be resolved by nonlinear terms.


4 · Why Exponential RG Relaxation Becomes a Power Law

The central resource assumption is that increasing model size, effective data, or compute extends the available RG flow only logarithmically:

\[ \tau_P=\kappa_P\log\!\frac{P}{P_0}, \qquad \tau_D=\kappa_D\log\!\frac{D}{D_0}, \qquad \tau_C=\kappa_C\log\!\frac{C}{C_0}. \]

Substituting these relations into exponential relaxation gives

\[ z_{\ell a}(P)\sim P^{-\kappa_P\omega_{\ell a}}, \qquad z_{\ell a}(D)\sim D^{-\kappa_D\omega_{\ell a}}, \qquad z_{\ell a}(C)\sim C^{-\kappa_C\omega_{\ell a}}. \]
RG time Resource space τ spectral deviation δ δ ∼ e⁻ᵠᵗ log C log δ δ ∼ C⁻ʳ τ ∝ log C Exponential decay in RG time becomes algebraic decay in parameters, data, or compute because the available RG time grows logarithmically with resources.

4.1 · From spectral deviations to loss

Assume terminal excess loss is a smooth readout of the joint spectral displacement. If the first nonzero coupling of mode \((\ell,a)\) occurs at order \(m_{\ell a}\ge 1\), then

\[ \Delta L:=L-L_\infty =\sum_{\ell,a} c_{\ell a}\,z_{\ell a}^{m_{\ell a}}+\cdots. \]

Along a compute trajectory, this becomes a sum of power laws:

\[ L(C)-L_\infty \sim \sum_{\ell,a}A_{\ell a}C^{-r_{\ell a}}, \qquad r_{\ell a}=m_{\ell a}\kappa_C\omega_{\ell a}. \]

At sufficiently large scale, the slowest decaying mode with nonzero excitation and nonzero loss coupling dominates:

\[ L(C)-L_\infty\sim A_\star C^{-r}, \qquad r=\min_{\ell,a}^{\text{loss-visible}} r_{\ell a}. \]

Why a single global exponent can emerge:

Each layer may have a different fixed point and many decay modes. The network still exhibits one asymptotic exponent because the slowest loss-visible mode acts as a spectral bottleneck for the whole model.


5 · What Spectral Marginality Contributes

The spectral RG construction defines the first-moment shell coupling

\[ g_E(\widetilde\lambda) =\frac{d\widetilde E_R}{d\log\widetilde\lambda} =\widetilde\lambda^2\widehat\rho_R(\widetilde\lambda). \]

For a power-law tail \(\widehat\rho_R(\widetilde\lambda)\sim\widetilde\lambda^{-\alpha}\),

\[ \beta_E(g_E) =\frac{dg_E}{d\log\widetilde\lambda} =(2-\alpha)g_E. \]

α > 2

Energy per logarithmic spectral band decreases toward the largest modes. The tail is stable but may be weak or underdeveloped.

α ≈ 2

Equal fixed-ratio spectral bands carry comparable first-moment energy. This is the candidate marginal, scale-balanced boundary.

α < 2

Energy increases toward the dominant tail. A few modes or correlation traps can carry an order-one burden.

Important distinction:

The shell derivative \(d/d\log\widetilde\lambda\) compares eigenvalue scales inside one checkpoint. It is not the resource-flow derivative \(d/d\log P\), \(d/d\log D\), or \(d/d\log C\). Therefore the loss exponents p, q, and r are not equal to 2 − α. The condition α ≈ 2 identifies the candidate fixed surface; the stability spectrum around that surface determines the macroscopic scaling exponents.

The numerical exponents are therefore predicted by

\[ p=\min_{\ell,a}m_{\ell a}\kappa_P\omega_{\ell a}, \qquad q=\min_{\ell,a}m_{\ell a}\kappa_D\omega_{\ell a}, \qquad r=\min_{\ell,a}m_{\ell a}\kappa_C\omega_{\ell a}, \] where the minima are restricted to modes that are excited by the resource constraint and visible to the chosen loss.

6 · Deriving the Joint Parameter–Data Scaling Law

Treat finite capacity and finite effective data as two cutoff fields,

\[ u_P=P^{-1},\qquad u_D=D_{\mathrm{eff}}^{-1}. \]

Let these fields have RG dimensions \(y_P>0\) and \(y_D>0\), and let the leading loss observable have scaling dimension \(x_L>0\). RG covariance gives

\[ \Delta L(u_P,u_D) =b^{-x_L}\, \mathcal L\!\left(b^{y_P}u_P,\,b^{y_D}u_D\right). \]

Choose \(b=P^{1/y_P}\). Then

\[ L(P,D_{\mathrm{eff}})-L_\infty =P^{-p} F\!\left(\frac{D_{\mathrm{eff}}}{P^{p/q}}\right), \qquad p=\frac{x_L}{y_P}, \qquad q=\frac{x_L}{y_D}. \]

This crossover law is more fundamental than a sum of two fitted powers. It predicts that large runs in the same spectral universality class depend on the single dimensionless coordinate

\[ x=\frac{D_{\mathrm{eff}}}{P^{p/q}}. \]

Model-limited regime

When x → ∞, data are abundant relative to model capacity. If F(x) → A, then

\[L(P,\infty)-L_\infty\sim A P^{-p}.\]

Data-limited regime

When x → 0, the model is large relative to its independent data. If F(x) ∼ Bx⁻ᑫ, then

\[L(\infty,D)-L_\infty\sim B D^{-q}.\]

The minimal crossover function with both asymptotes is

\[ F(x)=A+B x^{-q}. \]

Substitution recovers the familiar additive law:

\[ \boxed{ L(P,D)=L_\infty+A P^{-p}+B D^{-q}+\cdots }. \]

In this view, the Kaplan–Chinchilla form is the leading matched approximation to an RG crossover function, not the fundamental microscopic law. Corrections naturally include additional powers, mixed terms, and logarithms:

\[ L-L_\infty =A P^{-p}+B D^{-q} +A_2P^{-p_2}+B_2D^{-q_2} +H P^{-p}D^{-q}+\cdots. \]

7 · Compute-Optimal Scaling

In the unique-data regime, approximate training compute by

\[ C=\chi P D, \] where χ absorbs architecture- and accounting-dependent FLOPs per parameter per token.

Minimizing

\[ \Delta L=A P^{-p}+B D^{-q} \]

under the compute constraint gives the balance condition

\[ pA P_{\mathrm{opt}}^{-p} =qB D_{\mathrm{opt}}^{-q}. \]

The compute-optimal frontier is therefore

\[ \boxed{ P_{\mathrm{opt}}(C) =\left(\frac{pA}{qB\chi^q}\right)^{\!1/(p+q)} C^{q/(p+q)} } \] \[ \boxed{ D_{\mathrm{opt}}(C) =\left(\frac{qB}{pA\chi^p}\right)^{\!1/(p+q)} C^{p/(p+q)} }. \]

The optimal excess loss obeys

\[ \boxed{ L_{\mathrm{opt}}(C)-L_\infty \sim K C^{-r}, \qquad r=\frac{pq}{p+q}, \qquad \frac{1}{r}=\frac{1}{p}+\frac{1}{q} }. \]

What equal parameter and data scaling requires:

If p = q, then Pₒₚₜ ∝ C¹ᐟ² and Dₒₚₜ ∝ C¹ᐟ², so Dₒₚₜ/Pₒₚₜ is constant. But α ≈ 2 does not imply p = q. Equal allocation exponents require an additional equality of the capacity and data RG dimensions, yᴾ = yᴰ, or an equivalent dynamical symmetry.

7.1 · The result does not require the additive ansatz

Starting from the general crossover law \(\Delta L=P^{-p}F(D/P^{p/q})\), fixed compute selects a constant optimal crossover coordinate \(x_\star\). Therefore

\[ \frac{D_{\mathrm{opt}}}{P_{\mathrm{opt}}^{p/q}}=x_\star, \qquad P_{\mathrm{opt}}\propto C^{q/(p+q)}, \qquad D_{\mathrm{opt}}\propto C^{p/(p+q)}. \]

The allocation exponents are thus a consequence of RG crossover scaling itself; the additive law supplies one convenient interpolation and the corresponding amplitudes.


8 · Marginality, Critical Slowing Down, and Exponent Drift

8.1 · Marginal flow

If a linear stability eigenvalue vanishes, the leading flow may begin quadratically:

\[ \frac{dm}{d\tau}=-b m^2+O(m^3),\qquad b>0. \]

Then

\[ m(\tau)\sim\frac{1}{b\tau}. \]

Because \(\tau\propto\log C\), exact marginality produces

\[ m(C)\sim\frac{1}{\log C}, \qquad L(C)-L_\infty\sim C^{-r}(\log C)^{\widehat r}. \]

This is the RG analogue of critical slowing down: the restoring rate becomes very small near marginality, and at exact marginality the linear relaxation time diverges. Calling it physical critical slowing down strictly requires measuring a training-time relaxation scale and showing that it diverges near the spectral critical manifold.

8.2 · Why fitted exponents drift

If several layerwise modes remain visible over the accessible scale range,

\[ \Delta L(C)=\sum_i A_iC^{-r_i}. \]

The measured local exponent is

\[ r_{\mathrm{eff}}(C) =-\frac{d\log\Delta L}{d\log C} =\frac{\sum_i r_iA_iC^{-r_i}}{\sum_i A_iC^{-r_i}}. \]

It changes with scale until the slowest mode dominates. Near-degenerate modes, marginal logarithms, architecture transitions, repetition-induced instabilities, or a change in the loss-visible bottleneck all produce crossover. A straight log–log segment is therefore a finite-window effective law unless the spectral state confirms that the same fixed-point basin and the same leading mode remain active.


9 · Falsifiable Predictions and a Measurement Program

A useful theory must predict more than the existence of a fitted power law. The spectral-RG formulation makes several sharper tests.

9.1 · RG data collapse

For a grid of parameter and data budgets, plot

\[ Y=P^p\,[L(P,D)-L_\infty] \qquad\text{against}\qquad X=\frac{D_{\mathrm{eff}}}{P^{p/q}}. \]

Runs in the same spectral universality class should collapse onto a single curve \(Y=F(X)\). Compute-optimal runs should lie near one constant coordinate \(X=X_\star\).

Before rescaling After RG collapse D / Pᵠ L − L∞ X = D / Pᵖ⁄ᑫ Y = Pᵖ(L − L∞) X★: compute-optimal Schematic prediction: separate loss curves at different parameter counts collapse after rescaling by the RG exponents. The compute-optimal frontier occupies a constant crossover coordinate.

9.2 · Spectral prediction before terminal loss

  1. Train a controlled family over a grid of P, D, and C while holding architecture conventions, data mixture, optimizer family, and schedule rules fixed.
  2. Save intermediate checkpoints and measure αℓ, the retained ESD, ECS–tail alignment, detX / trace-log residuals, dominant-mode burden, and correlation traps.
  3. Fit the decay of spectral perturbations against log P, log D, and log C to estimate the stability rates κω.
  4. Identify the slowest modes that covary with held-out loss and use them to predict p, q, crossover, and compute-optimal allocation.
  5. Test those predictions on larger held-out runs rather than refitting the terminal loss curve.
import weightwatcher as ww

watcher = ww.WeightWatcher(model=model)
details = watcher.analyze(
    plot=False,
    detX=True,       # trace-log / ERG diagnostics
    randomize=True,  # correlation-trap diagnostics
)

# Track these quantities checkpoint by checkpoint and layer by layer:
# alpha, detX_val, rand_num_spikes, retained support, tail concentration, ...

Decisive benchmark:

Can small-run spectral trajectories predict the large-run loss exponents and the optimal P–D frontier more accurately than direct loss-only extrapolation? A positive result would convert the scaling exponents from fitted constants into measured properties of the spectral stability matrix.


10 · What Is Established, and What Remains a Proposal?

Established or directly calculable

  • Controlled model families exhibit useful empirical power-law loss scaling over substantial finite ranges.
  • WeightWatcher can measure layerwise ESDs, heavy-tail exponents, detX / trace-log diagnostics, and randomized-spectrum traps.
  • For ρ̂(λ̃) ∼ λ̃⁻ᵅ, the first-moment shell gain scales as λ̃²⁻ᵅ; α = 2 is therefore marginal under this shell power counting.
  • Given L = L∞ + AP⁻ᵖ + BD⁻ᑫ and C = χPD, the compute-optimal allocation follows by constrained minimization.

Proposed and testable

  • Strong layers approach compatible normalized spectral fixed surfaces near α ≈ 2 with trace-log scale fixing.
  • Resource growth corresponds to an effective RG time proportional to log P, log D, or log C.
  • Observed loss exponents are determined by the slowest loss-visible eigenmodes of the joint spectral stability matrix.
  • Scaling drift, repetition failure, and optimizer dependence can be predicted as crossover or activation of additional spectral directions.

The theory is therefore stronger than the statement “critical systems have power laws,” but it is not complete until the resource-to-RG-time map and the relevant stability eigenvalues are measured or derived. The key unknowns are \(\kappa_P,\kappa_D,\kappa_C\), the joint layerwise eigenvalues \(\omega_{\ell a}\), and the loss-coupling orders \(m_{\ell a}\).


11 · Compact Result

Spectral-RG scaling proposition:

Suppose trained layers approach a compatible SETOL/HTSR spectral fixed manifold; terminal excess loss is a smooth functional of perturbations around it; and finite parameter count and finite effective data act as scaling fields with dimensions yᴾ and yᴰ. Then

\[ L(P,D)-L_\infty =P^{-p}F\!\left(\frac{D}{P^{p/q}}\right), \qquad p=\frac{x_L}{y_P}, \qquad q=\frac{x_L}{y_D}. \]

The minimal crossover approximation gives \(L=L_\infty+AP^{-p}+BD^{-q}\). Under \(C=\chi PD\),

\[ P_{\mathrm{opt}}\propto C^{q/(p+q)}, \qquad D_{\mathrm{opt}}\propto C^{p/(p+q)}, \qquad L_{\mathrm{opt}}-L_\infty\propto C^{-pq/(p+q)}. \]

The exponents p and q are set by the leading loss-visible perturbations around the joint layerwise fixed manifold. The condition α ≈ 2 identifies marginal first-moment shell balance; it does not itself equal the loss-scaling exponent. Exact marginality adds logarithmic corrections and an RG form of critical slowing down.

In one sentence: scaling laws exist because exponential relaxation toward layerwise spectral fixed points is observed through resource coordinates whose natural RG time is logarithmic.


12 · References and Related Work

  1. Martin, “A Spectral Renormalization-Group View of Learning,” WeightWatcher research draft, 2026.
  2. Martin & Hinrichs, “SETOL: A Semi-Empirical Theory of (Deep) Learning,” arXiv:2507.17912, 2025.
  3. Martin & Mahoney, “Implicit Self-Regularization in Deep Neural Networks,” JMLR 22(165), 2021.
  4. Kaplan et al., “Scaling Laws for Neural Language Models,” arXiv:2001.08361, 2020.
  5. Hoffmann et al., “Training Compute-Optimal Large Language Models,” arXiv:2203.15556, 2022.
  6. Besiroglu et al., “Chinchilla Scaling: A Replication Attempt,” arXiv:2404.10102, 2024.
  7. Weng, “Scaling Laws, Carefully,” Lil’Log, 2026.
  8. WeightWatcher open-source repository.