Recursive variation-norm regularization
Implementation & benchmark of arXiv:2607.05546 — Deep Neural Variation Spaces: A Unifying Perspective on Depth and Complexity
Source paper: Deep Neural Variation Spaces: A Unifying Perspective on Depth and Complexity arXiv:2607.05546 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace ordinary hidden-weight decay with a recursive ℓ1 variation penalty on the coefficients used to combine activated functions from the previous layer. Use normalized activations \(\sigma_s(t)=\sigma(st)/s\) so that the learned scale parameter \(s\) controls feature shape separately from the coefficient magnitude charged by the variation norm.
Formulas
Mathematical statement
The paper defines normalized activations by \(\sigma_s(t):=\sigma(st)/s\) for \(s>0\), where \(\sigma\) is the base activation and \(t\) is a scalar preactivation. Its function spaces are recursively built from finite or measure-valued ℓ1-bounded linear combinations of activated functions from the preceding layer. A finite-width analogue is: \(f_0(x)=x\) or the affine dictionary \(f_0(x)=(x,1)\); each scalar unit at layer \(\ell\) is \(h_{\ell,j}(x)=\sigma_{s_{\ell,j}}(g_{\ell,j}(x))\), with \(g_{\ell,j}\) a linear combination of layer-\((\ell-1)\) units; and the recursive variation cost is \(V_0(f_0)=0\), \(V_\ell(h_{\ell,j})=V_{\ell-1}(g_{\ell,j})+\|u_{\ell,j}\|_1+|b_{\ell,j}|\), where \(u_{\ell,j}\) and \(b_{\ell,j}\) are incoming coefficients and bias. For an output \(f(x)=\sum_j a_jh_{L,j}(x)+b\), define \(V_L(f)=\sum_j|a_j|(1+V_L(h_{L,j}))+|b|\). The objective is empirical loss plus \(\lambda V_L(f)\). This is a finite-network surrogate for the paper's recursively ℓ1-bounded function spaces: the useful property is that the penalty charges functional composition and coefficient mass rather than only raw parameter magnitudes. The paper's representer argument also gives finite-dimensional coefficient control: if \(\mathbf B\) is invertible and \(\mathbf c=\mathbf B^{-1}\mathbf r(b)\), then a uniform bound \(\sup_{b\in[b_1,b_2]}\|\mathbf c\|_1=C<\infty\) exists.
Implementation notes
Integrate the method into the hidden MLP layers, specifically the incoming affine tensor of every hidden unit and the final readout, during training. Use a dense network with width 128 and depth 2, 4, or 8. Parameterize each unit as \(h_{l,j}=\sigma_{s_{l,j}}(g_{l,j})\), where \(g_{l,j}=u_{l,j}^{\top}h_{l-1}+b_{l,j}\), and parameterize \(s_{l,j}=\operatorname{softplus}(r_{l,j})+10^{-3}\). In every forward pass, compute a recursive cost: initialize \(q_{0,j}=0\); for each layer compute \(q_{l,j}=q_{l-1,j}+\|u_{l,j}\|_1+|b_{l,j}|\); for output coefficients \(a_j\), set \(V=\sum_j |a_j|(1+q_{L,j})+|b_{out}|\). Optimize cross-entropy or MSE plus \(\lambda V\). Replace absolute values by \(\sqrt{z^2+\epsilon}\), with \(\epsilon=10^{-8}\), if direct subgradients are unstable. The exact paper quantity is the normalized activation in the first formula; the recursive finite-width \(V\) is an explicit engineering surrogate for its recursively defined ℓ1-bounded function space. Do not estimate the representer-theorem constant \(C\) during training. Sweep \(\lambda\) over \(10^{-5},10^{-4},10^{-3},10^{-2}\), and compare against the same models with AdamW/L2 decay, matching validation loss and optimizer settings. First run MNIST or Fashion-MNIST with ReLU, GELU, and SiLU. Record training and validation accuracy, learned \(V\), parameter norms, gradient variance, activation magnitudes, and loss at equal optimizer steps. Test the structural prediction separately on one-dimensional regression: train on samples of \(y=\sin(2\pi kx)\) and evaluate Fourier amplitude on held-out frequencies, measuring the largest frequency learned at fixed \(V\). A positive result is lower validation error, lower gradient variance, or equal accuracy with smaller recursive variation cost than L2. The depth-saturation prediction is supported if deeper ReLU models do not increase the maximum learned frequency at matched \(V\), while non-homogeneous GELU or SiLU models do. A negative result is underfitting or no improvement over L2 at matched validation loss.
Verification
Stage 1 · Toy mechanism gate: Failed ✗
Stage 2 · Mechanism transferred to benchmark: Not tested
Stage 2 · Practical benchmark result: Not run
Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works
Stage 1 — Mechanism check agent confidence 9/10
Built a finite-width recursive variation-norm MLP with learnable normalized SiLU scales and smooth absolute values, plus a fixed-seed regression benchmark against AdamW/L2. The core implementation checks passed with zero numerical error, and scale changes altered the normalized SiLU shape. However, the variation penalty produced much lower V but substantially worse validation MSE: best variation MSE was 0.4726 versus 0.2584 for L2, indicating underfitting rather than a useful regularization win in this setup.
- Agent confidence
- 9/10
- Baseline
- AdamW/L2, best validation MSE 0.2583797574 at weight_decay=0.01; train MSE 0.2745188177; parameter squared L2 358.7202; V 183.5451.
- Idea
- Adam plus recursive variation penalty, best validation MSE 0.4725931883 at lambda=0.001; train MSE 0.4767749608; parameter squared L2 112.3655; V 6.3401. Formula max error=0; recursive-cost max error=0; normalized-SiLU shape difference between s=0.25 and s=4 was 0.7544.
Limitations: Only one fixed seed, one-dimensional sinusoidal regression task, width 32, depth 2, 700 steps, and SiLU were tested. MNIST/Fashion-MNIST, ReLU/GELU comparisons, depths 4/8, Fourier-frequency analysis, gradient variance, matched-validation-loss or matched-V comparisons, and broader lambda/seed sweeps were not tested.
How to run: python3 run_experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Artifacts
- report.md 1.5 KB View
- results.json 2.5 KB View Raw
- run_experiment.py 4.9 KB View Raw