Drift-Assisted Hyperbolic Recurrent Layer
Implementation & benchmark of arXiv:2608.10975 — Affine Anosov Maps on $\mathbb{R}^n$: Classification, Index Spectrum, and Stability at Infinity
Source paper: Affine Anosov Maps on $\mathbb{R}^n$: Classification, Index Spectrum, and Stability at Infinity arXiv:2608.10975 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Construct a recurrent layer with a hidden clock coordinate that advances by a nonzero drift and use that coordinate to define a state-dependent metric for the remaining hidden channels. The layer may contain neutral or sign-flipping Euclidean modes, but the metric is designed so that forward and backward Jacobian products become uniformly contracting on complementary subspaces, imitating the White-map mechanism. This targets vanishing or exploding gradients in long sequences while preserving near-neutral information channels.
Formulas
Mathematical statement
For the affine map f(z) = A z + v, a fixed point exists exactly when v belongs to the image of I minus A, because z = A z + v is equivalent to (I minus A)z = v. The paper's noncompact mechanism permits an Anosov metric when v is not in that image, even if A has a unit-modulus eigenvalue. Implement a recurrent map z_(k+1) = F(z_k) with Jacobian J_k and a positive-definite state-dependent metric P(z). Require J_k transpose times P(z_(k+1)) times J_k to be at most exp(-2 alpha) times P(z_k) on stable directions, where alpha is the target contraction exponent. For a clock coordinate c_(k+1) = c_k + delta, choose diagonal metric weights P_ii(c) = exp(2 beta_i c). A neutral Euclidean derivative then has metric growth exponent approximately beta_i delta. The predicted stability boundary is lambda_Euclidean,i plus beta_i delta equal to zero.
Implementation notes
Use this as a recurrent or state-space block rather than as a generic optimizer. Split the hidden state into a scalar clock c, a stable bank h_s, and optionally an unstable or bidirectional bank h_u. Set c_(k+1) = c_k + delta, with delta parameterized as a signed nonzero value, and define h_(k+1) = G_theta(h_k, c_k, x_k). Represent the metric implicitly using diagonal weights P_ii(c) = exp(2 beta_i c), so no dense matrix is needed. At each sampled timestep, compute the next state, draw a few random stable probe vectors u, and use automatic differentiation to obtain Jacobian-vector products J_k u. Compute the metric ratio r(u) = norm_P(z_(k+1))(J_k u) divided by norm_P(z_k)(u), then add the penalty lambda times max(0, log(r(u)) + alpha) squared. The paper supplies the affine fixed-point obstruction and drift-enabled metric mechanism; the implementation estimates local Jacobian gains and finite-time metric exponents empirically. First experiment: compare a vanilla linear RNN, an orthogonal RNN, and this drift-assisted layer on Copy Memory and sequential MNIST at lengths 100, 500, and 1000. Sweep beta times delta and the residual gain. The quantitative prediction is that the measured long-horizon gradient slope changes approximately linearly with beta times delta, crosses zero near lambda_Euclidean plus beta delta equal to zero, and becomes unstable when the estimated stable-channel metric gain exceeds exp(-alpha). Agreement within 20 percent is the required initial test.
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.