Green-Margin Residual Dynamics
Implementation & benchmark of arXiv:2608.14715 — A Green Function Approach to Smooth Nonautonomous Topological Equivalence with Unbounded Nonlinearities under $(μ,ν)$--Dichotomies
Source paper: A Green Function Approach to Smooth Nonautonomous Topological Equivalence with Unbounded Nonlinearities under $(μ,ν)$--Dichotomies arXiv:2608.14715 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Replace unconstrained residual blocks by a nonautonomous linear backbone plus a learned nonlinear perturbation, and constrain the perturbation gain using the Green operator of the backbone. The resulting network can contain both contracting and expanding channels, but the accumulated response of the perturbation remains bounded when its Green margin is below one. A differentiable or periodically updated estimate of this margin becomes both an architecture constraint and a training monitor.
Formulas
Mathematical statement
Let the continuous backbone be $x'(t)=A(t)x(t)$ with transition matrix $T(t,s)$ and an invariant projection $P(t)$ defining stable and unstable subspaces. Its Green kernel is $G(t,s)=T(t,s)P(s)$ for $s\leq t$ and $G(t,s)=-T(t,s)(I-P(s))$ for $s>t$. Define the induced Green norm $\Gamma=\sup_t\int_0^\infty\|G(t,s)\|\,ds$, or its discrete analogue $\Gamma_N=\max_k\sum_{j=0}^{N-1}\|G_{k,j}\|$. For a perturbation $f(t,z)$ with Lipschitz constant $L$, the Green fixed-point construction is contractive when $q=L\Gamma<1$. In a residual network, $A_k$ is the prescribed linear backbone, $F_k$ is the learned residual map, and $L_k\approx\|J_{F_k}\|_2$. Use $q_N=\max_k\sum_j\|G_{k,j}\|L_j<1$. For smooth conjugacy, additionally require a first-variation margin $q_N^{(1)}=\max_k\sum_j\|G_{k,j}\|\|D F_j\|_2<1$; this is the discrete analogue of the paper's derivative smallness condition ensuring invertibility of the inverse equivalence map.
Implementation notes
1. Exact integration point: use a depth-indexed residual network or linear state-space model. Set each block to $z_{k+1}=A_kz_k+F_k(z_k)$, where $A_k$ is initialized as a diagonal or block-diagonal matrix with selected contracting and expanding channels, and $F_k$ is a small MLP. Estimate a discrete dichotomy projection $P_k$ from the known backbone; for a diagonal backbone, $P_k$ selects channels whose cumulative products contract forward. 2. Pseudocode: compute or refresh transition products $T_{k,j}$; form $G_{k,j}=T_{k,j}P_j$ for $j\le k$ and $G_{k,j}=-T_{k,j}(I-P_j)$ for $j>k$; estimate $L_j$ by one or two power iterations on Jacobian-vector products; compute $q_N=\max_k\sum_j\|G_{k,j}\|_2L_j$. Penalize $\max(0,q_N-q_0)^2$ with target $q_0=0.8$, or rescale $F_j\leftarrow q_0F_j/q_N$ when $q_N>q_0$. 3. Computed from the mechanism: the Green kernel and contraction inequality. Estimated empirically: Jacobian norms, projections for non-diagonal $A_k$, and finite-depth $q_N$. 4. First cheap experiment: train a 20- or 50-layer residual MLP on MNIST or CIFAR-10, comparing ordinary residual blocks with Green-margin blocks at matched parameter count. Sweep a global residual multiplier $\eta$ and record exploding activations, gradient norms, and test accuracy. The quantitative prediction is a sharp degradation boundary near $\eta_c=1/q_N(\eta=1)$: stable-gradient runs should occur for $\eta q_N<1$, while instability and rapidly increasing sensitivity should appear as $\eta q_N\to1$; the measured boundary should agree with the estimated threshold within roughly 20%. Also test the predicted sensitivity scaling $\|\delta z_N\|/\|\delta z_0\|\propto(1-q_N)^{-1}$ below the boundary.
Verification
Stage 1 · Toy mechanism gate: Passed ✓
Stage 2 · Mechanism transferred to benchmark: Confirmed ✓
Stage 2 · Practical benchmark result: Significant win ✓
Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works
Stage 1 — Mechanism check agent confidence 8/10
Built a Green-Margin residual MVP with discrete Green-kernel computation, stable/unstable diagonal channels, scalar fixed-point sweeps, and a matched 20-layer residual regression comparison. The mechanism manifested: q scaled linearly with slope 3.3333, the observed contraction boundary was eta=0.3159 versus predicted 0.3000 (5.3% error), and the response matched 1/(1-q) to 1.8e-15 relative error. Margin control reduced peak gradients from 8.06 to 0.330 and maintained effective q=0.8, but final MSE was worse, 0.261 versus 0.176, so this is a stability win rather than an accuracy win.
- Agent confidence
- 8/10
- Baseline
- final MSE 0.17585; maximum parameter gradient 8.0576; effective q 5.1004
- Idea
- final MSE 0.26123; maximum parameter gradient 0.3305; raw q 76.8434; effective q after rescaling 0.8000; residual scale 0.01041; toy q slope 3.3333 observed versus 3.3333 predicted; boundary eta 0.3159 observed versus 0.3000 predicted; response-law maximum relative error 1.8e-15
Limitations: The training comparison is a tiny linear regression experiment rather than MNIST or CIFAR, uses conservative global residual rescaling instead of differentiable per-layer Jacobian penalties, and does not test learned nonautonomous or nonlinear backbones, generalization, FLOPs, or long-run training stability.
How to run: python3 run_experiment.py
Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.14715)
Beats the tuned baseline by 72.6% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0021
- Idea mean
- 0.0006
- Effect (Δ)
- -0.0015 (−72.6%; negative = idea better)
- Wins
- 8 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±19.2%
- Mechanism
- Confirmed ✓
- Practical effect
- Helps
- Baseline tuning
- swept over 3 configs
Only the built-in dynamics track and rnn_small GRU were tested. The implementation constrains the GRU recurrent matrix spectral norm as a practical Green-margin proxy rather than estimating the full nonautonomous transition kernel or per-layer Jacobian margins. The run used 12 epochs, 400 training examples, 400 test examples, one small learning-rate grid, and no longer-horizon rollout, non-diagonal backbone, FLOP/speed, or target-margin ablation.
How to run: python3 bench_green_margin.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Stage 2 — Benchmark latest Worked ✓
Agent confidence: 8/10
Implemented Green-Margin Residual Dynamics on the structurally matched dynamics track using the shared rnn_small GRU architecture. The intervention projects the recurrent perturbation so the measured Green estimate satisfies q=Gamma||W_hh||2<=0.8. Across 8 paired seeds it significantly improved test MSE: 0.00057228 versus baseline 0.00208631, paired delta=-0.00151403, permutation p=0.0081; the trained-model mechanism signature confirmed q≈0.8000.
- Baseline
- test MSE mean 0.00208631, std 0.00045501, tuned lr=0.006; sweep means lr=0.001: 0.00410370, lr=0.003: 0.00338617, lr=0.006: 0.00169839
- Comparison
- paired delta=-0.00151403, 8/8 idea wins, permutation p=0.0081, verdict idea better (significant)
- Idea
- test MSE mean 0.00057228, std 0.00029326, tuned lr=0.006; idea sweep means lr=0.001: 0.23657939, lr=0.003: 0.00440150, lr=0.006: 0.00057228; q estimate 0.78160
- Mechanism signature
- trained-model observed recurrent gain 0.159998, Gamma=5, observed q=0.799992, predicted response bound 4.9998, observed input sensitivity 0.3732, confirmed=true
Benchmark result
Beats the tuned baseline by 72.6% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).
- Benchmark
- Dynamics forecasting
- Model
- rnn_small
- Paired seeds
- 8
- Baseline mean
- 0.0021
- Idea mean
- 0.0006
- Effect (Δ)
- -0.0015 (−72.6%; negative = idea better)
- Wins
- 8 / 8 paired seeds
- p-value
- 0.0081 (permutation test, 20 000 shuffles)
- Smallest detectable effect
- ±19.2%
- Mechanism
- Confirmed ✓
- Practical effect
- Helps
- Baseline tuning
- swept over 3 configs
Only the built-in dynamics track and rnn_small GRU were tested. The implementation constrains the GRU recurrent matrix spectral norm as a practical Green-margin proxy rather than estimating the full nonautonomous transition kernel or per-layer Jacobian margins. The run used 12 epochs, 400 training examples, 400 test examples, one small learning-rate grid, and no longer-horizon rollout, non-diagonal backbone, FLOP/speed, or target-margin ablation.
How to run: python3 bench_green_margin.py
Artifacts
- REPORT.md 1.8 KB View
- bench_green_margin.py 5.7 KB View Raw
- bench_report.json 2.9 KB View Raw
- report.md 1.6 KB View
- report_bench_2026-09-02T232158.md 5.2 KB View
- results.json 3.9 KB View Raw
- run_experiment.py 6.1 KB View Raw