✗ Mechanism failed
2026
Use the behavior-subspace gap as a trust-region constraint when applying a shared update to multiple recurrent modules or experts. A proposed common update is accepted only when post-update behavior subspaces remain close to their leader and their graph subspaces remain sufficiently transverse, preventing one shared optimizer step from destabilizing dynamically different members.
Useful7/10
Difficulty6/10
Novelty9/10
△ Mechanism confirmed, baseline not beaten
2026
Treat the hidden-state update of an RNN, SSM, or neural ODE as a linearized input-output system and penalize its frequency-response peaks. The regularizer targets amplification caused by nonnormal state matrices, which may be large even when all eigenvalues are stable, and therefore controls transient oscillations and long-horizon sensitivity more directly than an eigenvalue-radius penalty.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Run several heterogeneous recurrent or state-space network copies and couple their hidden states through a directed hypergraph with proportional and integral feedback. The proportional term contracts disagreement, while the integral state rejects persistent replica-specific biases that ordinary consensus coupling can only bound. This creates a controllable synchronization-versus-divergence transition rather than an unstructured regularization coefficient.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Replace a monolithic nonlinear latent transition in a neural world model or sequence predictor with two lifted latent channels: a global channel encoding scene-wide or sequence-wide structure and local channels encoding patches, segments, tokens, or objects. Propagate both channels with a block-structured linear operator and decode them jointly, so the encoder remains nonlinear but multi-step latent rollouts do not repeatedly apply a deep transition network.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a continuous-depth or recurrent residual block with a prescribed polynomial Lyapunov decay near its equilibrium. The architecture combines a fixed radial stabilizer with a learned component that is constrained to have zero radial projection, allowing slow algebraic transients and long memory while preventing asymptotic hidden-state growth.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Use the paper's explicit compact factor of a symplectic state-transition matrix to measure aggregate rotation speed in hidden-state dynamics. Penalize excessive or rapidly varying angular velocity rather than penalizing the full recurrent matrix, preserving nontrivial Hamiltonian rotations while suppressing phase drift that can destabilize long sequences.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained token mixer or feed-forward residual map with a feature-conditioned rational operator whose transfer matrix is positive real on the positive orthant. Apply it through a resolvent, rather than an additive residual, so that the accretivity certificate yields a nonexpansive implicit update and suppresses activation explosions.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an expensive nonlinear rollout of a recurrent or neural state-space model by a locally affine rollout whose Jacobian is evaluated once at the current state and then frozen over a short horizon. Use the resulting transition matrix as an explicit stability monitor and optionally penalize or clip its spectral radius, reducing exploding long-horizon predictions without forcing the entire nonlinear network to be globally contractive.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add an explicit transport-delay state to a recurrent neural network, state-space model, or learned optimizer whenever actions, gradients, or control inputs arrive after a fixed delay. Use the queued inputs to construct a finite-horizon predictor state and apply the neural transition or controller to that predicted state rather than to the stale state. The design transfers the paper's delay-as-transport-PDE and backstepping-to-stable-target strategy into a differentiable predictor with an…
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the adapted linear latent model as a cheap receding-horizon planner or training-time controller around a nonlinear neural predictor. Optimize a short sequence of latent corrections with a quadratic objective, while constraining latent states and inputs to remain inside the region where the Koopman approximation has been identified and its transition spectrum is stable.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use several phase-locked states as distinct attractors of one recurrent network and shape their basin asymmetry through the phase-delay composite spectrum. This creates a controllable associative-memory architecture in which a desired memory receives a larger basin without adding a separate classifier or explicit nearest-neighbor lookup.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Add an uncertainty-aware observation scheduler to a neural state-space model or recurrent world model. Between expensive observation-encoder updates, propagate the latent state using the learned dynamics; periodically compute a decimated Riccati prediction and choose the largest skip length whose predicted covariance remains below a task-specific bound. This replaces a fixed observation stride with a principled, state-dynamics-dependent schedule.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Train a recurrent neural network or state-space model using a Poincare-style event loss: identify two consecutive latent alignment events and require the latent position and velocity at the second event to equal a transformed version of the first. Evaluate the Jacobian of this return map and penalize unstable non-neutral Floquet multipliers, producing long-horizon trajectories that are both periodic or symmetry-periodic and locally stable.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat a momentum optimizer or recurrent state update as a damped oscillatory feedback system whose local closed-loop dynamics have a cubic characteristic polynomial. Estimate local damping, oscillation frequency, and feedback gain, then cap the learning-rate or momentum gain using the cubic Routh-Hurwitz inequality so that oscillatory divergence is prevented before it appears in the loss.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use explicitly stochastic latent dynamics to detect hidden-state changes that are invisible in the observed output spectrum. Near the integral-memory regime, constrain or monitor cross diffusion with a forward-versus-reverse path statistic, preventing output-equivalent latent models from developing physically implausible irreversible dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Add a resonance-estimation module to a recurrent network or state-space model and regularize the decay spectrum of its observable correlations. Instead of using eigenvalues of a small projected recurrent matrix as memory timescales, estimate dominant poles from multi-step correlations and a resolvent/Krylov fit, thereby remaining valid when projection eigenvalues are ill-conditioned or hidden resonances occur. The method is intended to preserve useful long memory while suppressing unstable or…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or state-space network as a locally linear dynamical system and select a small set of hidden-state or module coordinates that have unusually high leverage on a target output through a dominant unstable or weakly damped eigenmode. Use the ranking both for red-team targeted perturbations and for defense: penalize, prune, or damp selected coordinates so that target amplification is reduced without uniformly shrinking all recurrent dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an instantaneous largest-eigenvalue learning-rate ceiling with a delayed-instability monitor for a slowly ramped optimizer or network gain. When a dominant complex eigenpair crosses from negative to positive real part, permit a controlled post-crossing interval, but stop or roll back when the accumulated positive growth budget exceeds the perturbation/noise margin. This exploits slow-passage delay without allowing unbounded training instability.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Turn a latent recurrent model into an observer that continuously corrects its hidden state from noisy or partial observations while certifying both estimation-error convergence and disturbance attenuation. The bounded-real operator inequality becomes a trainable regularizer for a neural correction gain, providing a principled alternative to unconstrained teacher forcing or ad hoc residual correction.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition by a ring-coupled cubic vector field whose radial component drives hidden states toward a prescribed sphere. The angular component remains trainable and can encode information, while the radial Lyapunov dynamics suppress exploding and vanishing state norms during long rollouts.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add an observer correction to a recurrent or state-space neural model and constrain its local dynamics so latent-state errors contract according to a quadratic Lyapunov certificate. The design tolerates nonlinear residuals that are not globally Lipschitz, provided their one-sided growth and quadratic inner-bound constants satisfy a computable matrix inequality.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Build a recurrent module from two finite-state factors: a normalization state and a winner-selection state. Choose or learn their coupling so that the joint transition system contains a certified composite two-cycle, giving the network a small robust memory state, while every fixed-input generator still collapses most states toward attractors. The module can be embedded in a continuous RNN using soft state assignments during training and straight-through discretization for algebraic auditing.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a standard recurrent state update or finite-order SSM filter with a causal relative-history operator using a weakly singular kernel k(s)=s^{p-1}m(s), where 0<p<1. The resulting layer retains information over a power-law range of timescales and introduces tunable frequency-dependent phase and attenuation, while remaining implementable through a small bank of exponentially decaying states.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an isotropic local mixing layer with a kinetic layer that smooths features in x and transports them in y along the characteristic direction x. The layer should be useful for phase-space data, learned simulators, and world models in which positions or transported quantities evolve through coupled drift and diffusion rather than independent Euclidean motion.
Useful7/10
Difficulty5/10
Novelty7/10