Diffusive fast-slow recurrent block
Implementation & benchmark of arXiv:2607.24994 — Diffusion stabilises time-periodic solutions in conservation laws coupled to a relaxation oscillator
Source paper: Diffusion stabilises time-periodic solutions in conservation laws coupled to a relaxation oscillator arXiv:2607.24994 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace a standard recurrent update with a slow-fast oscillator whose fast hidden state is coupled across feature channels by a graph-Laplacian diffusion term. The slow-fast structure permits sharp transient transitions, while diffusion suppresses unstable disagreement modes and should make long unrolled computation less sensitive to initialization and perturbations.
Formulas
Mathematical statement
The paper uses the fast-slow system $\dot{x}=g_{1}(x,y,z)$, $\dot{y}=g_{2}(x,y,z)=1$, and $\eta\dot{z}=f(x,y,z)$, where $x$ is a slow state, $y$ is a phase variable, $z$ is a fast state, and $0<\eta\ll1$ controls time-scale separation. Its perturbation equation is $\partial_t z(t,x)=-G'(G^{-1}(w^{*}(x)+z(t,x)))[\partial_{xx}z(t,x)+2z(t,0)]=-({\mathscr A}z)(t,x)+b(z(t,x),t,x)$, where $G$ is an invertible coordinate map, $w^{*}$ is the reference periodic profile, ${\mathscr A}$ is the linear dissipative operator, and $b=O(\|z\|^{2})$. The paper also establishes the profile estimate $c_{-}(1-x^{2})\leq w(t,x)\leq c_{+}(1-x^{2})$, showing that diffusion plus a suitable invariant or symmetric subspace controls perturbation growth. The neural adaptation replaces $\partial_{xx}$ by a positive graph Laplacian $L$ with $L\mathbf{1}=0$ and eigenvalues $0=\lambda_{1}<\lambda_{2}\leq\cdots$, and uses $\kappa L$ to damp nonconstant feature modes.
Implementation notes
(1) Integration point: implement a recurrent or state-space layer operating on a sequence $u_s$, with hidden state $h_s\in\mathbb{R}^{d}$, fast state $z_s\in\mathbb{R}^{d}$, and scalar phase $\phi_s$. Interpret feature channels as nodes of a fixed graph and construct a normalized graph Laplacian $L=I-D^{-1/2}AD^{-1/2}$, where $A$ is a sparse nonnegative channel adjacency matrix and $D_{ii}=\sum_jA_{ij}$. Apply diffusion only to $z$, not directly to the input or slow state. Use small $\eta$ but integrate the fast equation with either two or four substeps per recurrent step. (2) Pseudocode: initialize $h,z,\phi$; for each input $u_s$, compute $g=g_\theta(h,\phi,u_s)$; compute $f=f_\theta(h,\phi,z,u_s)$; for $j=1,\ldots,m$, update $z\leftarrow z+(\Delta t/(m\eta))f-(\Delta t/m)\kappa Lz$, recomputing $f$ after each substep; update $h\leftarrow h+\Delta t g$ and $\phi\leftarrow\phi+\Delta t$. Add the paper-inspired symmetric initialization by pairing channels and initializing paired values identically, or test this as an ablation. (3) Compute $Lz$ exactly from the sparse graph. Estimate the spectral damping rate empirically with the Rayleigh quotient $\widehat\lambda(z)=z^{T}Lz/(z^{T}z)$ after removing the mean component; the expected linear damping of a disagreement mode is approximately $\kappa\lambda_i$. Tune $\kappa$ so that the diffusion timescale is comparable to the slow update, while keeping $\Delta t/\eta$ numerically stable. Do not assume the paper's continuum stability theorem transfers automatically; verify Jacobian spectra numerically. (4) First experiment: train a 2-layer, 128-channel block on sequential-MNIST or permuted-MNIST, comparing a GRU and a vanilla fast-slow block against the diffusive version at matched parameters and FLOPs. Measure validation accuracy, gradient norm through 500-1000 steps, sensitivity to Gaussian hidden-state perturbations, and convergence to a periodic attractor when inputs are held constant. Success means lower exploding-gradient frequency and lower output variance under perturbations without reducing clean accuracy; a stronger result is equal accuracy with fewer recurrent steps or a larger stable $\Delta t$.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.