Unverified 2026

Resonant-Mode Observability Regularizer

Implementation & benchmark of arXiv:2607.25686 — Properties of resonant states for generic smooth expanding maps

Usefulness6/10
Difficulty6/10
Novelty8/10

Source paper: Properties of resonant states for generic smooth expanding maps arXiv:2607.25686 ⓘ · analyzed Aug 31, 2026

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

Idea description

For a learned recurrent or state-space model, estimate leading Koopman or transfer-operator modes and force their evaluations on a small set of latent states to be linearly independent. This transfers the paper's generic invertibility construction and discourages duplicated, weakly observable, or spectrally collapsed dynamical modes, potentially improving long-horizon prediction and interpretability.

Formulas

F_T(x) = (f₁(x), ..., fₚ(x), Re fₚ₊₁(x), Im fₚ₊₁(x), ..., Re fₚ₊q(x), Im fₚ₊q(x))
Aᵢⱼ = F_T,ᵢ(zⱼ), and σₘᵢₙ(A) > 0 if and only if det(A) ≠ 0
||D Tⁿ(x)v|| ≥ C exp(nθ)||v||, with C > 0 and θ > 0
fᵢ(x) = 0 implies ||∇fᵢ(x)|| ≥ ε₀, while ∇fᵢ(x) = 0 implies |det(∇²fᵢ(x))| ≥ ε₁

Mathematical statement

Let T map a latent manifold M to itself, and let f₁ through fₚ be real modes and fₚ₊₁ through fₚ₊q be complex modes. Split each complex mode into its real and imaginary parts and define F_T(x) as the resulting real feature vector in Rᴷ, where K = p + 2q. For K latent states z₁ through zₖ, construct the evaluation matrix A with entries Aᵢⱼ = F_T,ᵢ(zⱼ). The paper's key finite-dimensional certificate is that A is invertible, equivalently that its smallest singular value is positive. In the neural implementation, maximize the smallest singular value while normalizing mode columns. For real modes, additionally encourage zero to be a regular value and critical points to be nondegenerate: whenever fᵢ(x) = 0, the gradient norm should be bounded below, and whenever the gradient vanishes, the Hessian determinant should be nonzero. The expanding-map condition is that the derivative satisfies ||D Tⁿ(x)v|| ≥ C exp(nθ)||v|| for constants C > 0 and θ > 0.

Implementation notes

1. Integration point: use a GRU, neural ODE, or nonlinear state-space model with latent transition zₜ₊₁ = Tθ(zₜ). Maintain a replay buffer of latent trajectories. Every several training steps, estimate K leading Koopman modes with EDMD: form feature vectors from latent states, compute the empirical Gram matrix G and lagged covariance matrix H, solve K_EDMD = G†H, and extract its eigenvectors as approximate modes. Keep real modes directly and split complex modes into real and imaginary channels. 2. Pseudocode: sample K latent states zⱼ; evaluate the mode matrix Aᵢⱼ = fᵢ(zⱼ); compute L_obs = −log(σ_min(A)² + δ) + α||AᵀA − I||²_F; add this to the prediction loss; update θ with the combined loss. For real modes, sample points close to fᵢ = 0 and add a penalty softplus(ε₀ − ||∇fᵢ||)². Near estimated critical points, add softplus(ε₁ − |det(∇²fᵢ)|)². Stop gradients through the EDMD eigendecomposition during the first implementation. 3. Directly computed quantities are the evaluation matrix, singular values, mode correlations, and finite-difference or autodifferentiated derivatives. Estimated quantities are the Koopman modes, eigenvalues, zero-level sets, and critical points. Estimate expansion by measuring the minimum singular value of the Jacobian product D Tⁿ over replay states. 4. First cheap experiment: train a two-dimensional latent GRU on trajectories from the expanding torus map T(x) = 2x modulo 1 and from a smooth perturbed expanding map. Compare ordinary prediction loss against the observability-regularized model using K = 4 modes and four sampled latent states. The predicted signature is a rank transition: when the number of informative sampled states reaches K, σ_min(A) should become positive; duplicated modes or insufficiently excited trajectories should yield σ_min(A) approximately zero. The regularized model should maintain a persistent singular-value gap and distinct estimated eigenvalues. Report whether its median σ_min(A) is at least twice the baseline value and whether long-horizon prediction error decreases.

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.