△ Mechanism confirmed, baseline not beaten
2026
Use the paper's scattering energy balance as a measurable regularizer for an existing recurrent or state-space model instead of replacing its architecture. Penalize positive violations of the per-step energy inequality and, for paired examples, penalize violations of incremental passivity so that the model learns not to amplify perturbations over long sequences.
Useful6/10
Difficulty3/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build a recurrent or continuous-depth block from a dissipative vector field and project every state derivative onto the tangent cone of a closed convex hidden-state set. Unlike ordinary clipping, tangent-cone projection removes only the outward component at the boundary and preserves admissible motion. Under the paper's maximal-dissipativity result, the continuous flow is nonexpansive in its initial state.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
In a partially observed reinforcement-learning or model-based control agent, expose the state-estimator innovation to the action head through a dedicated residual feedback branch. The policy produces a nominal action from the estimated latent state, while a learned innovation-compensation branch corrects actions when observations disagree with predicted latent dynamics. This explicitly separates nominal policy behavior from estimation-induced corrections and should help during fast transients…
Useful6/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Augment a neural router with the age of its current expert or latent regime and use an age-dependent hazard to determine when switching is likely. Unlike ordinary token-wise softmax routing, the router can learn non-geometric residence times, suppressing unstable expert oscillations while still allowing rapid transitions when the current regime becomes inappropriate.
Useful6/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained input-conditioned recurrent transition with a bilinear latent update, so controls modulate a fixed linear latent dynamics matrix through low-rank state-input interactions. The resulting cell preserves the computational simplicity of linear propagation while representing multiplicative effects of actions that an additive control term cannot capture efficiently.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace a dense recurrent transition matrix with a periodic CMV-style product of alternating local 2x2 unitary cores. The transition is exactly norm-preserving, has O(n) trainable parameters under periodic tying, and can be applied through local factor operations rather than stored as an n-by-n matrix. Use turnover refactorization when changing the ordering or boundary connection of cores, enabling a compact cyclic unitary state-space layer.
Useful6/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Add a training-time regularizer that keeps the empirical joint covariance of hidden activations on multiple inputs close to the recursively predicted NNGP covariance. The regularizer targets the finite-width fluctuations quantified by the Wasserstein result, and is particularly appropriate for recurrent networks and attention blocks with shared weights, where hidden states at different positions or time steps are statistically coupled.
Useful6/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Represent each latent state as a Heisenberg-group element and replace Euclidean interpolation in an upsampling or recurrent transition block by a four-point horizontal refinement plus the exact central signed-area correction. The module preserves the geometry of noncommutative composition, allowing the central latent coordinate to encode path-dependent information that ordinary coordinate-wise interpolation discards.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Regularize a learned state-space transfer function so its matrix response has positive real part on sampled points in the unit disk and its associated reproducing-kernel Gram matrix is positive semidefinite. This provides a frequency-domain stability signal that complements rollout-based penalties and spectral-radius clipping.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a generic recurrent transition with two coupled unitary transitions that share one block column and differ by a sign on the other block column. Each transition preserves hidden-state norm exactly, while the structured difference gives a controlled two-path recurrent architecture for long-context modeling.
Useful6/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Model the scalar feedback route in a recurrent layer as a rank-one perturbation of its open-loop transition. Regularize the frequency response of that route so that no mode reaches unit loop gain, directly targeting oscillatory and slowly decaying instabilities rather than relying only on gradient clipping.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Use the paper's third-order phase-locked-loop equations as a recurrent neuron instead of a leaky integrate-and-fire unit. Emit a spike whenever the phase crosses a chosen threshold, allowing one state trajectory to represent both slow burst envelopes and fast within-burst oscillations.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a discrete or one-hot recurrent state table with a low-dimensional vector memory whose event embeddings are orthogonal whenever the corresponding events are mutually exclusive in an input exclusivity graph. The module uses continuous state vectors and can therefore target dimension \(d=\xi(G)\), whereas a discrete state encoding is lower-bounded by \(N\geq\chi(G)\). This should be tested on graph-defined formal-language recognition tasks, where the graph is known and the claimed…
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Attach predictive distributions to successive information-update steps of a recurrent, state-space, iterative, or diffusion model and penalize violations of the measure-valued martingale condition. The model may become more certain as information arrives, but its later forecasts must not exhibit systematic conditional bias relative to earlier forecasts.
Useful6/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Add a two-sided cone-restricted spectral penalty to a recurrent or state-space model. Instead of estimating growth using a symmetric singular-value surrogate, jointly optimize a positive right vector and positive left vector in the extended quotient from the paper, targeting a real generalized eigenvalue of the learned non-selfadjoint transition operator.
Useful6/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Augment a recurrent or state-space layer with a finite-order causal Volterra compensator that models and cancels dominant nonlinear feedback around a stable linear transition. Use quadratic terms by default and add cubic terms only when the model must operate farther from equilibrium, making truncation order an explicit compute and robustness control.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace pointwise spectral normalization of an RNN transition with a stability constraint on the entire family of input-conditioned matrices. Use a learned positive-definite metric P so every transition contracts in the same state geometry, approximating the paper's uniform exponential stability and input-forgetting guarantee.
Useful6/10
Difficulty5/10
Novelty6/10
✓ Mechanism works
2026
Replace spectral-radius-only stabilization of a recurrent or state-space transition matrix with a numerical-range constraint. Penalize directions in which the Hermitian part of a rotated transition matrix has a large maximal eigenvalue, controlling nonnormal transient amplification and polynomial state propagation.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Choose the retained context length by balancing the statistical complexity of adding lag j against the squared prediction bias from discarding it. Unlike a fixed context window, the rule uses both the remaining-horizon spectrum and the estimated tail energy, allowing a model to expand or shrink its memory online.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace a standard nonlinear recurrent transition with a truncated Carleman lift containing levels $z_j\approx u^{\otimes j}$, coupled by linear maps that represent quadratic, linear, and forcing terms. The resulting transition is linear in the lifted state but still expresses nonlinear dynamics in the original state, while the highest-order omitted interaction supplies an explicit truncation-defect signal that can be used for adaptive order selection or regularization.
Useful6/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a contractive recurrent transition by its explicit Schäffer isometric lift, optionally augmenting it with a second operator satisfying the nonlinear covariance relation $V_1V_2=V_2f(V_1)$. The lifted state preserves or nearly preserves hidden-state energy, while the covariance penalty or parameterization imposes an algebraic structure on multiple recurrent channels.
Useful6/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Treat a recurrent or state-space layer as a finite-state Markov cocycle and constrain optimizer steps using the paper's inverse-logarithmic sensitivity of Lyapunov exponents near a zero exponent gap. Instead of enforcing a crude spectral-norm bound, allow updates that are harmless for long-run growth while shrinking steps that could substantially change the recurrent stability profile.
Useful6/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2025
Regularize a neural dynamical map so that its log-volume expansion is cohomologous to a constant rather than forcing the Jacobian determinant to be constant at every state. Learn a scalar potential that explains transient expansion and penalize only the non-telescoping component, which should reduce long-horizon gradient explosion or collapse while retaining useful average expansion.
Useful6/10
Difficulty5/10
Novelty7/10