✓✓ Beats tuned baseline 2026

Dissipative Completely-Monotone Memory Layer

Implementation & benchmark of arXiv:2607.12871 — Graph-space well-posedness for diffusion equations with degenerate instantaneous diffusion

Usefulness7/10
Difficulty5/10
Novelty5/10

Source paper: Graph-space well-posedness for diffusion equations with degenerate instantaneous diffusion arXiv:2607.12871 ⓘ · analyzed Aug 30, 2026

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

Idea description

Replace an unconstrained recurrent or state-space transition with a finite quadrature of completely monotone memory modes. Couple the visible state and memory states as adjoint operators, so their cross terms cancel in the energy derivative and the layer is contractive even when visible-state damping is zero.

Formulas

$$\partial_tu(t)+\mathsf{A}_0u(t)+\mathsf{A}_1(k*u)(t)=f(t),\qquad u(0)=u_0.$$
$$k(t)=\int_{[0,\infty)}e^{-\lambda t}\,d\nu(\lambda),\qquad M_0=\nu([0,\infty)),\qquad M_1=\int_{[0,\infty)}\lambda\,d\nu(\lambda).$$
$$\dot x=-Qx-B^\top\sum_{j=1}^m w_jz_j+Wr,\qquad \dot z_j=Bx-\lambda_jz_j.$$
$$E(x,z)=\frac12\|x\|^2+\frac12\sum_{j=1}^mw_j\|z_j\|^2,\qquad \dot E=-x^\top Qx-\sum_{j=1}^mw_j\lambda_j\|z_j\|^2\le0.$$

Mathematical statement

The paper studies the memory equation $\partial_tu(t)+\mathsf{A}_0u(t)+\mathsf{A}_1(k*u)(t)=f(t)$, where $u$ is the physical state, $\mathsf{A}_0$ and $\mathsf{A}_1$ are operators induced by symmetric bilinear forms, and $k$ is completely monotone. A completely monotone kernel has the Bernstein representation $k(t)=\int_{[0,\infty)}e^{-\lambda t}\,d\nu(\lambda)$, with nonnegative measure $\nu$, total mass $M_0=\nu([0,\infty))$, and first moment $M_1=\int\lambda\,d\nu(\lambda)$. Introduce one memory state $z_\lambda$ per decay rate, satisfying $\dot z_\lambda(t)=-\lambda z_\lambda(t)+Bx(t)$; then the memory convolution is represented by an integral of $z_\lambda$. The neural adaptation uses a finite positive quadrature $\nu\approx\sum_{j=1}^m w_j\delta_{\lambda_j}$, with $w_j\ge0$ and $\lambda_j\ge0$. The coupled dynamics are $\dot x=-Qx-B^\top\sum_jw_jz_j+Wr$ and $\dot z_j=Bx-\lambda_jz_j$, where $Q\succeq0$ is optional visible-state damping, $x\in\mathbb{R}^d$ is the layer state, $z_j\in\mathbb{R}^p$ are memory states, and $r$ is the input. For $E=\frac12\|x\|^2+\frac12\sum_jw_j\|z_j\|^2$, the homogeneous system obeys $\dot E=-x^\top Qx-\sum_jw_j\lambda_j\|z_j\|^2\le0$. The terms $-x^\top B^\top\sum_jw_jz_j$ and $\sum_jw_jz_j^\top Bx$ cancel because the aggregation and embedding maps are adjoint.

Implementation notes

Integrate this as a recurrent or state-space block between Transformer or MLP layers, operating on a sequence tensor with shape [batch, time, d]. Choose $m$ memory modes with logarithmically spaced rates $\lambda_j$ covering the task horizon, and positive weights $w_j$ normalized so $\sum_jw_j=M_0$. The trainable parameters are $B\in\mathbb{R}^{p\times d}$, input projection $W$, and optionally a positive semidefinite damping matrix $Q=LL^\top$; do not train the return coupling independently, because it must remain $-B^\top$ to preserve cancellation. For each time step, use implicit Euler on the coupled system: solve $x_{t+1}=x_t+h[-Qx_{t+1}-B^\top\sum_jw_jz_{j,t+1}+Wr_t]$ and $z_{j,t+1}=z_{j,t}+h[Bx_{t+1}-\lambda_jz_{j,t+1}]$. A cheaper semi-implicit variant first computes $z_{j,t+1}=e^{-h\lambda_j}z_{j,t}+((1-e^{-h\lambda_j})/\lambda_j)Bx_t$, using the limit $h$ when $\lambda_j=0$, and then updates $x$. Add a nonlinear gated readout after the stable state rather than placing an unconstrained nonlinearity inside the certified homogeneous dynamics. The exact structural checks are $w_j\ge0$, $\lambda_j\ge0$, $Q\succeq0$, and tied adjoint couplings. Estimate the useful rate range from sequence lengths, for example $\lambda_j\in[1/T,1]$, and optionally learn positive rates using $\lambda_j=\operatorname{softplus}(a_j)$. First test on sequential MNIST and a small WikiText character model against a vanilla GRU and an unconstrained diagonal SSM with equal parameter count. Measure hidden-state norm growth, exploding-gradient frequency, long-context validation loss, and robustness when the integration step size is increased. Success means bounded energy in homogeneous tests, fewer NaNs and gradient spikes, and lower perplexity or classification error at sequence lengths beyond training horizons. Include an ablation with $Q=0$ to verify that stability comes from memory damping and adjoint cancellation rather than ordinary visible-state regularization.

Verification

Beats tuned baseline

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 9/10

Built a finite positive-quadrature dissipative memory layer with tied adjoint couplings and implicit Euler integration in dissipative_memory.py. The toy verification confirmed exact cross-term cancellation (maximum error 0), the explicit-Euler boundary h*=2λ/(λ²+b²) across five b values (maximum error 1.1e-16), linear continuous dissipation in λ including zero dissipation at λ=0, and implicit-Euler energy contraction for steps 0.01 through 100. On the small length-40 sum task, the memory model reached MSE 8.50e-6 versus 39.19 for the scalar unconstrained RNN, but this comparison is not a parameter-matched or difficult sequence benchmark.

Agent confidence
9/10
Baseline
Toy mechanism: identity error 0; sequence regression validation MSE 39.1932; implicit multi-mode max energy ratio 0.99945.
Idea
Toy mechanism: explicit-boundary max error 1.11e-16; continuous damping-scaling max error 4.44e-16 and λ=0 derivative 0; implicit multi-mode energy ratios 0.99945, 0.94203, 0.44969, 0.03138, 0.00107 for h=[0.01,0.2,1,10,100]; sequence regression validation MSE 8.50e-6.

Limitations: No sequential MNIST, WikiText, long-context extrapolation, FLOP-matched GRU/SSM benchmark, repeated-seed statistics, or trained multi-dimensional task was tested. The sequence comparison uses a deliberately tiny scalar RNN and the layer's simple semi/implicit setup; the certified homogeneous dynamics exclude input forcing and nonlinear readout effects.

How to run: python3 experiment.py && /home/maxwelhelp/main/bin/python3 smoke_test.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2607.12871)

Beats the tuned baseline by 88.4% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0004
Idea mean
0.0001
Effect (Δ)
-0.0004 (−88.4%; negative = idea better)
Wins
8 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
±44.9%
Mechanism
Confirmed ✓
Practical effect
Helps
Baseline tuning
swept over 3 configs
Limitations:

Only the structurally matched dynamics track was tested. The idea model was not parameter-count matched to the stock GRU, and long-context extrapolation, increased integration-step robustness, gradient-spike frequency, and other tracks were not tested. The mechanism signature uses a trained idea model but probes its homogeneous transition separately from the forced task rollout.

How to run: python3 bench_stage2.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 a finite positive-quadrature dissipative recurrent model with tied adjoint couplings and implicit-Euler updates on the structurally matched dynamics track using the canonical trainer. Across 8 paired seeds, the idea achieved MSE 0.0000519248 versus the swept GRU baseline MSE 0.0004488516, with delta_mean -0.0003969268 and permutation p=0.0081, yielding the required significant-win verdict. A trained-model mechanism signature confirmed homogeneous implicit-Euler energy contraction with observed maximum ratio 0.97504 <= 1.

Baseline
dynamics/rnn_small GRU; learning-rate sweep {0.001, 0.003, 0.01}; best lr=0.01; full 8-seed MSE mean=0.0004488515951, std=0.0002281392821
Idea
DissipativeRNN; two positive modes rates {0.05, 0.5}; implicit-Euler step=0.1; best lr=0.01; full 8-seed MSE mean=0.0000519247626, std=0.0000223992837; delta=-0.0003969268325; permutation p=0.0081; 8/8 paired wins

Benchmark result

Beats the tuned baseline by 88.4% (p=0.0081, wins 8 / 8 paired seeds; metric: lower is better).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0004
Idea mean
0.0001
Effect (Δ)
-0.0004 (−88.4%; negative = idea better)
Wins
8 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
±44.9%
Mechanism
Confirmed ✓
Practical effect
Helps
Baseline tuning
swept over 3 configs
Limitations:

Only the structurally matched dynamics track was tested. The idea model was not parameter-count matched to the stock GRU, and long-context extrapolation, increased integration-step robustness, gradient-spike frequency, and other tracks were not tested. The mechanism signature uses a trained idea model but probes its homogeneous transition separately from the forced task rollout.

How to run: python3 bench_stage2.py

Artifacts

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