✗ Failed on benchmark 2026

Delay-Shape Master-Stability Coupling

Implementation & benchmark of arXiv:2608.10076 — Generalized Master Stability of Heterogeneous Delay-Coupled Networks

Usefulness7/10
Difficulty6/10
Novelty7/10

Source paper: Generalized Master Stability of Heterogeneous Delay-Coupled Networks arXiv:2608.10076 ⓘ · analyzed Sep 1, 2026

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

Idea description

Replace a monolithic recurrent transition with multiple recurrent modules coupled through a trainable directed matrix whose spectrum is explicitly shaped for the delay-dependent master-stability region. Use heterogeneous indegrees and nonreciprocal edge weights rather than forcing symmetric or all-to-all coupling, because delays can make these structures more stable than homogeneous reciprocal coupling.

Formulas

$$\dot\xi_k(t)=A(t)\xi_k(t)+\sigma\mu_kB(t)\xi_k(t-\tau),\qquad \Lambda(\sigma\mu_k,\tau)<0\ \ \forall k\ge2.$$
$$\Lambda(\alpha,\tau)=\limsup_{T\to\infty}\frac{1}{T}\log\frac{\|\xi(T)\|}{\|\xi(0)\|},\qquad \dot\xi=A(t)\xi+\alpha B(t)\xi(t-\tau).$$
$$\delta x_{t+1}=J_t\delta x_t+\sigma\mu_kK_t\delta x_{t-d},\qquad \rho\!\left(\begin{bmatrix}J_t&0&\cdots&\sigma\mu_kK_t\\I&0&\cdots&0\\&\ddots&\ddots&\vdots\\0&&I&0\end{bmatrix}\right)<1.$$
$$\mathcal L_{\mathrm{MSF}}=\max_{k\ge2}\widehat\Lambda(\sigma\mu_k,\tau)+\beta\sum_{k\ge2}\max\!\left(0,\widehat\Lambda(\sigma\mu_k,\tau)\right)^2.$$

Mathematical statement

Let $s(t)$ be the synchronized trajectory of $N$ identical modules with intrinsic vector field $f$, coupling output $h$, delay $\tau$, and coupling strength $\sigma$. Linearizing transverse to synchronization gives modal delay equations $\dot\xi_k(t)=A(t)\xi_k(t)+\sigma\mu_kB(t)\xi_k(t-\tau)$, where $A(t)=Df(s(t))$, $B(t)=Dh(s(t-\tau))$, and $\mu_k$ are nontrivial eigenvalues of the directed coupling operator. The generalized master stability function is the largest Lyapunov exponent $\Lambda(\alpha,\tau)$ of $\dot\xi=A(t)\xi+\alpha B(t)\xi(t-\tau)$, with $\alpha=\sigma\mu_k$; synchronization is linearly stable when $\max_{k\ge2}\Lambda(\sigma\mu_k,\tau)<0$. For a discrete neural transition $x_{t+1}=F_\theta(x_t)+\sigma W_gH_\theta(x_{t-d})$, the local modal approximation is $\delta x_{t+1}=J_t\delta x_t+\sigma\mu_kK_t\delta x_{t-d}$, and stability requires the spectral radius of the augmented delay companion matrix to be below one for every transverse mode. The engineering objective is to minimize the worst transverse exponent or spectral radius while preserving the synchronized mode.

Implementation notes

Use a small collection of $N$ identical or partially shared recurrent blocks, each producing $h_i(t)=H_\theta(x_i(t))$. Integrate the coupling immediately before the block transition: $x_i(t+1)=F_\theta(x_i(t))+\sigma\sum_j(W_g)_{ij}h_j(t-d)$, where $d$ is an integer delay-buffer length. Parameterize $W_g$ with unconstrained directed logits, apply row normalization or spectral rescaling, and retain a separate self-transition so the synchronized mode is not destroyed. Pseudocode: initialize a delay queue; at every step compute all $h_i$; read $h(t-d)$; update each module using $F_\theta(x_i)+\sigma W_gh(t-d)$; periodically estimate the nontrivial eigenvalues $\mu_k$ of $W_g$ or its diffusive form; perturb a synchronized trajectory with random transverse vectors; roll out the linearized delayed recurrence for $M$ steps; estimate $\widehat\Lambda(\sigma\mu_k,\tau)$ from log-norm growth; add the master-stability penalty to the task loss and backpropagate through the finite rollout. The paper supplies the modal stability criterion and the prediction that heterogeneity and nonreciprocity can enlarge the stable region; trajectory Jacobians and finite-horizon exponents are estimated empirically. First run copy-memory and delayed sequence prediction with eight GRU-like modules, comparing symmetric all-to-all, random directed, and optimized directed heterogeneous $W_g$ at matched parameter count. Sweep delay $d$ and coupling $\sigma$. The predicted signature is a sharp divergence boundary where the largest measured transverse exponent crosses zero. The optimized directed heterogeneous network should have a larger stable $(d,\sigma)$ region than the symmetric baseline; require the measured boundary to agree with the estimated $\max_k\widehat\Lambda=0$ contour within 20%. Also test whether hidden-state disagreement $D_t=N^{-1}\sum_i\|x_i-\bar x\|^2$ decays exponentially for negative estimated exponent and grows for positive exponent.

Verification

Failed on benchmark

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: No measurable effect

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 reproducible delayed master-stability MVP in verify_delay_shape.py, including companion-matrix spectral analysis, finite-rollout Lyapunov estimation, and a symmetric-versus-directed heterogeneous network comparison. The boundary prediction rho(C)=1 was confirmed to machine precision, and measured exponents matched log rho with maximum error 1.65e-15. At delay 2, the directed heterogeneous network changed the predicted transverse exponent from +0.01066 for the symmetric ring to -0.27413, while measured disagreement slope changed from +0.02132 to -0.27505, demonstrating the proposed stability mechanism. The generic claim that increasing delay always progressively shrinks the stable region was not observed in this scalar recurrence: the boundary plateaued at alpha=0.28 for delays 1-8.

Agent confidence
8/10
Baseline
8-node symmetric ring: max transverse eigenvalue magnitude=1.00000; predicted worst log spectral radius=+0.01066; measured disagreement log slope=+0.02132; final disagreement=0.00478
Idea
8-node directed heterogeneous row-stochastic matrix: max transverse eigenvalue magnitude=0.26414; predicted worst log spectral radius=-0.27413; measured disagreement log slope=-0.27505; final disagreement=1.65e-24; maximum exponent-fit absolute error=1.65e-15

Limitations: This is a scalar constant-Jacobian toy, not a trained GRU or sequence-prediction task. The directed matrix was selected by random search rather than optimized through a differentiable master-stability loss. No GPU benchmark, FLOP-matched accuracy test, time-varying Jacobian, complex nonlinear modules, or broad delay/coupling network sweep was performed.

How to run: python3 verify_delay_shape.py

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

Ahead of the baseline (−0.0%) but not statistically significant (p=0.8453, wins 3 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0038
Idea mean
0.0038
Effect (Δ)
-0 (−0.0%; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.8453 (permutation test, 20 000 shuffles)
Smallest detectable effect
±0.0%
Mechanism
Not confirmed ✗
Practical effect
No effect
Baseline tuning
swept over 3 configs
Limitations:

Only the registered built-in dynamics track was tested. The coupling matrix was fixed rather than learned or optimized through a differentiable master-stability loss, and the trained disagreement signature saturated at numerical zero for both systems. The local implementation uses a small GRUCell-based coupled model with the bench training path rather than modifying the built-in rnn_small class.

How to run: python3 bench_delay_shape.py

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

Stage 2 — Benchmark latest Failed ✗

Agent confidence: 9/10

The registered dynamics benchmark completed with eight paired seeds and a shared three-point learning-rate sweep. The companion-matrix sanity check passed to numerical precision, but the directed heterogeneous delayed coupling produced no measurable task improvement: paired delta was -8.73e-11 with permutation p=0.8453, and the trained hidden-disagreement prediction was not confirmed because both systems synchronized to numerical zero. The canonical bench verdict is therefore no measurable effect, not a win.

Baseline
Best symmetric reciprocal-ring configuration lr=0.006, epochs=10, sigma=0.42, delay=2: test MSE mean 0.003796056960709393, std 0.0013761704084519022.
Idea
Best directed heterogeneous configuration lr=0.006, epochs=10, sigma=0.42, delay=2: test MSE mean 0.0037960568733979017, std 0.0013761705927236632; paired delta -8.731149137020111e-11, p=0.8453.

Benchmark result

Ahead of the baseline (−0.0%) but not statistically significant (p=0.8453, wins 3 / 8 paired seeds).

Benchmark
Dynamics forecasting
Model
rnn_small
Paired seeds
8
Baseline mean
0.0038
Idea mean
0.0038
Effect (Δ)
-0 (−0.0%; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.8453 (permutation test, 20 000 shuffles)
Smallest detectable effect
±0.0%
Mechanism
Not confirmed ✗
Practical effect
No effect
Baseline tuning
swept over 3 configs
Limitations:

Only the registered built-in dynamics track was tested. The coupling matrix was fixed rather than learned or optimized through a differentiable master-stability loss, and the trained disagreement signature saturated at numerical zero for both systems. The local implementation uses a small GRUCell-based coupled model with the bench training path rather than modifying the built-in rnn_small class.

How to run: python3 bench_delay_shape.py

Artifacts

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