Unverified 2026

Contractive Slow-State Cross-Coupled Reservoir

Implementation & benchmark of arXiv:2607.22318 — On a cross coupling of Rulkov neural maps

Usefulness6/10
Difficulty5/10
Novelty6/10

Source paper: On a cross coupling of Rulkov neural maps arXiv:2607.22318 ⓘ · analyzed Aug 30, 2026

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

Idea description

Build an RNN from fast nonlinear units coupled through a spectrally contractive slow state. The fast component can generate rich transients, while the slow component has a provable absorbing radius because its linear recurrence contracts and its neural forcing is bounded. Cross-coupling strength is swept to detect the onset of expressive high-dimensional attractors without permitting state explosion.

Formulas

$$\|z_{t+1}\|_*\leq \mu\|z_t\|_*+C,\qquad \|z\|_*:=\|P^{-1}z\|_\infty,\qquad \rho(A)=\max_i|\lambda_i|\leq\mu<1.$$
$$\|z_t\|_*\leq \mu^t\|z_0\|_*+C\frac{1-\mu^t}{1-\mu},\qquad R_{\mathrm{abs}}=\frac{C}{1-\mu}+\delta.$$
$$h_{i,t+1}=\tanh(W_hh_{i,t}+U_ss_{i,t}+B_iu_t),\qquad s_{t+1}=A_ss_t+\tanh(W_{sh}h_t+Kh_t^{\mathrm{cross}}+b_s).$$
$$F^m(p)=p,\qquad F^m(q)=p,\qquad q\neq p,\qquad |\det D F^m(q)|>1.$$

Mathematical statement

Use the paper's sufficient condition for an absorbing set in z(t+1) = A z(t) + b(z(t)). If A = P D P⁻¹, every eigenvalue λᵢ of A satisfies |λᵢ| ≤ μ < 1, and ||b(z)||₂ ≤ C for all z, then in the induced norm ||z||* = ||P⁻¹z||∞ one has ||z(t+1)||* ≤ μ||z(t)||* + C. Therefore ||z(t)||* is eventually bounded by C/(1−μ) plus an arbitrary margin. Implement fast states hᵢ and slow states sᵢ with hᵢ(t+1) = tanh(Wₕhᵢ(t) + Uₛsᵢ(t) + Bᵢu(t)) and s(t+1) = Aₛs(t) + tanh(Wₛₕh(t) + K h_cross(t) + bₛ). Here h_cross is a permutation or mixing of states from other cells, Aₛ has spectral radius μ < 1, and K controls cross-coupling. A snap-back diagnostic searches for p and q satisfying Fᵐ(p) = p, Fᵐ(q) = p, q ≠ p, and |det D Fᵐ(q)| > 1.

Implementation notes

First, integrate the mechanism as a recurrent backbone for sequence prediction, a reservoir with a trained readout, or a latent transition model in a world model. Use two or more fast-slow cells, with cross-coupling initially entering only through K h_cross in the slow update. Parameterize A_s so its spectral radius is controlled: for a diagonal version use A_s = diag(μ tanh(r_j)); for a full version use A_s = μ Q diag(tanh(r_j)) Q⁻¹, with Q orthogonal. At every time step, compute the fast states, form a permutation or average of other-cell fast states, update the slow states, and then compute the readout from the concatenated fast and slow states. Log the estimated spectral radius of A_s, the empirical forcing magnitude C_t, the predicted radius C/(1−μ), actual state norms, and finite-time Lyapunov exponents. The paper supplies the contraction inequality and absorbing-radius prediction; the forcing bound, fixed points, Lyapunov exponents, and snap-back candidates must be estimated numerically. For a first cheap experiment, compare this model with a tanh RNN and GRU on Mackey-Glass prediction and permuted-MNIST, using matched parameter counts. Sweep μ in {0.8, 0.9, 0.95, 0.99, 1.01} and several values of ||K||. The quantitative prediction is that for μ < 1, state norms eventually remain near or below C/(1−μ), with radius scaling approximately as 1/(1−μ); for μ > 1, this uniform bound disappears. Increasing ||K|| should raise the largest Lyapunov exponent, with a qualitative transition near its measured zero crossing. If a snap-back candidate is found, its computed determinant magnitude should exceed one and coincide with positive long-run Lyapunov exponent.

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.