✗ Mechanism failed 2026

Smooth-RG Modewise Optimizer

Implementation & benchmark of arXiv:2607.15784 — Scaling regimes of the Kuramoto-Sivashinsky equation from the functional renormalization group

Usefulness7/10
Difficulty6/10
Novelty7/10

Source paper: Scaling regimes of the Kuramoto-Sivashinsky equation from the functional renormalization group arXiv:2607.15784 ⓘ · analyzed Aug 30, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Treat parameter-space curvature modes as RG momentum shells and use a smooth cutoff to construct a scale-dependent preconditioner rather than abruptly clipping eigenmodes. The optimizer should expose measurable crossovers between overdamped, KPZ-like, and nearly inviscid relaxation, allowing the learning rate and damping to change at empirically detected transitions instead of following a fixed schedule.

Formulas

$$\partial_t h=\nu\partial_x^2h-\tau\partial_x^4h+\frac{\lambda}{2}(\partial_xh)^2,\qquad \nu<0,\ \tau>0.$$
$$\partial_\kappa\Gamma_\kappa[\Phi]=\frac{1}{2}\operatorname{Tr}\left[(\Gamma_\kappa^{(2)}[\Phi]+R_\kappa)^{-1}\partial_\kappa R_\kappa\right].$$
$$\Gamma_\kappa=\int_{t,x}\bar\varphi\left\{\partial_t\varphi-f_\kappa^\nu(\partial_t,\partial_x)\partial_x^2\varphi-\frac{\lambda}{2}(\partial_x\varphi)^2-f_\kappa^D(\partial_t,\partial_x)\bar\varphi\right\},\qquad a_\kappa(p)=f_\kappa^\nu(0,p)p^2.$$
$$t(q)\propto q^{-z},\qquad z\approx\frac{3}{2}\ \text{(KPZ)},\quad z\approx2\ \text{(EW)},\quad z\approx1\ \text{(inviscid)}.$$

Mathematical statement

The paper studies the Kuramoto–Sivashinsky equation $\partial_t h=\nu\partial_x^2h-\tau\partial_x^4h+(\lambda/2)(\partial_xh)^2$, with negative viscosity $\nu<0$ and stabilizing hyperviscosity $\tau>0$. Its functional RG has the exact flow $\partial_\kappa\Gamma_\kappa[\Phi]=(1/2)\operatorname{Tr}[(\Gamma_\kappa^{(2)}[\Phi]+R_\kappa)^{-1}\partial_\kappa R_\kappa]$, where $\kappa$ is the running inverse length scale, $\Phi$ denotes the fields, $\Gamma_\kappa$ is the effective action, $\Gamma_\kappa^{(2)}$ is its Hessian, and $R_\kappa$ is a smooth regulator. The NLO ansatz retains momentum- and frequency-dependent effective viscosity and noise: $\Gamma_\kappa=\int\bar\varphi\{\partial_t\varphi-f_\kappa^\nu(\partial_t,\partial_x)\partial_x^2\varphi-(\lambda/2)(\partial_x\varphi)^2-f_\kappa^D(\partial_t,\partial_x)\bar\varphi\}$. The linear response denominator is $i\omega+f_\kappa^\nu(\omega,p)p^2$, so define effective damping $a_\kappa(p)=f_\kappa^\nu(0,p)p^2$. For neural-network curvature modes, replace momentum $p$ by mode index $q$ and use a smooth regulator $R_s(q)=\alpha s^2/(\exp(q^2/s^2)-1)$, with spectral cutoff $s$ and damping coefficient $\alpha>0$. The predicted relaxation law is $t(q)\propto q^{-z}$ with $z\approx3/2$, $2$, and $1$ in the KPZ, Edwards–Wilkinson, and inviscid regimes respectively.

Implementation notes

1. Integration point: use this as a replacement for AdamW on a small MLP or Transformer, partitioning parameters into approximate curvature modes. Every 100 optimization steps, run eight Hutchinson/Lanczos probes to estimate the largest 64 Hessian eigenvalues $q_i$ or block-curvature modes. Measure each mode's effective relaxation response by applying a small perturbation $\delta\theta_i$ and recording the projected gradient change over 5–20 optimizer steps. 2. Pseudocode: initialize $s$ above the largest measured mode; at each update estimate $a_i=\langle\Delta g_i,\delta\theta_i\rangle/\langle\delta\theta_i,\delta\theta_i\rangle$, compute $R_s(q_i)=\alpha s^2/[\exp(q_i^2/s^2)-1]$, and update $\theta_i\leftarrow\theta_i-\eta g_i/(|a_i|+R_s(q_i)+\epsilon)$. Decrease $s$ geometrically only after the current spectral shell has been sampled, using no hard eigenvalue cutoff. 3. Computed from the paper: the smooth-regulator construction, scale-shell interpretation, and expected exponents. Estimated empirically: Hessian modes, damping $a_i$, and crossover locations. Fit $\log t_i$ against $\log q_i$ in sliding windows to estimate $z$. 4. First cheap experiment: train a width-256 MLP on MNIST and a 2-layer Transformer on a character-level copy task, comparing AdamW, Shampoo, and this optimizer at matched compute. Measure gradient explosions, loss decay, and mode relaxation times. The falsifiable signature is a slope change near shell transitions: $z\approx2$ at intermediate modes, $z\approx1$ where estimated $a_i$ approaches zero, and $z\approx1.5$ after low-mode coarse-graining. Each crossover should remain within 20% under changes in batch size or width.

Verification

Mechanism failed

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 smooth-regulator modewise optimizer and numerical verification suite. The regulator asymptotic predictions were confirmed, crossover roots matched numerical observations within 0.025%, and the predicted Euler stability boundary eta*=2.0 was confirmed. However, the relaxation exponents were z≈3.0 at low/intermediate modes and z≈0 at high modes, not the claimed z≈1.5, 2, or 1; the toy comparison also strongly favored the AdamW-like baseline, so the proposed mechanism was not validated.

Agent confidence
9/10
Baseline
AdamW-like diagonal quadratic: final loss 1.30e-15 after 400 steps for all tested s values.
Idea
Smooth-RG: final loss 0.170 for s=0.3, 1.342 for s=1.0, and 6.212 for s=3.0; measured relaxation z≈3.00 at q=1e-4..0.2 and z≈0 at q=5..30; crossover relative error <=0.025%.

Limitations: Only a diagonal positive-quadratic toy problem was tested; no MLP, MNIST, Transformer, Hutchinson/Lanczos curvature estimation, adaptive shell schedule, noisy gradients, wall-clock comparison, or negative/indefinite curvature was evaluated. The claimed exponents were tested only as the implied relaxation law of the proposed diagonal update.

How to run: python3 smooth_rg_experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 4 files · code, reports and structured results