△ Mechanism confirmed, baseline not beaten
2026
Replace Gaussian covariance propagation in a neural state-space model with a finite Perron–Frobenius operator acting on coefficients of a learned density basis. A neural encoder maps observations to latent states, while an eDMD-derived matrix transports the full coefficient vector and supports multimodal or skewed uncertainty. This creates a cheap deterministic uncertainty layer that can be rolled forward for long horizons without repeatedly sampling particles.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Attach a probabilistic reachable-set head to a neural world model so that long-horizon predictions produce both a mean trajectory and an uncertainty envelope. Train or calibrate the model using the probability that the predicted envelope intersects an unsafe region, allowing early-warning losses to penalize risk before an actual violation appears. The transferable signature is a predictable monotone increase in warning probability as the reachable set approaches or intersects a forbidden set.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Replace an unconstrained recurrent or state-space transition Jacobian by a passive Gram-like component plus a controlled non-reciprocal perturbation, and regularize the resulting resolvent norm. The goal is not merely to reduce eigenvalue magnitude: it is to suppress soft and highly non-normal modes whose transient amplification can destabilize long-horizon inference even when all eigenvalues appear stable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a Markovian recurrent update with an MPS-valued temporal influence state that couples adjacent pairs of memory sites, mimicking the paper's CDU3 two-column construction. The hidden state retains structured correlations across multiple past time steps while computation remains linear in sequence length and polynomial in the bond dimension, rather than exponential in the memory horizon.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Make the observation-injection gain state dependent, increasing it only when the projected unobserved dynamics approach the Hurwitz boundary. This creates a feedback controller for latent drift while avoiding the observation-noise amplification caused by using a globally oversized gain.
Useful7/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Add a low-dimensional actuator-distortion model alongside a neural state-transition model instead of assuming that commanded control is the realized control. For a transition $x_{t+1}=F_\theta(x_t,u_t^{\mathrm{cmd}}+d_\phi(x_t,u_t^{\mathrm{cmd}}))$, jointly fit the intrinsic dynamics parameters $\theta$ and disturbance parameters $\phi$, with a strong simplicity prior on $d_\phi$. This should prevent the dynamics network from absorbing systematic actuator errors and improve cross-regime…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build an implicit or unrolled graph neural operator on a symmetric simplicial mesh, and perform every symmetry-compatible linear solve in a fixed representation-theoretic basis rather than the original edge/face basis. The same basis can be reused for Poisson, Maxwell, diffusion, and learned linear combinations of DEC operators, yielding parallel independent blocks and lower peak memory without changing the discretized solution.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a small linear latent transition to a neural encoder-decoder and use normalized Koopman eigenfunction residuals to identify unreliable latent modes. Rather than retaining every eigenmode of the learned transition, reconstruct forecasts only from modes whose one-step residual is small on held-out temporal windows. This turns spectral decomposition into an explicit denoising and model-selection mechanism for neural state-space models.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace or augment a recurrent or state-space block with a small ensemble of stable linear memory lifts. Each lift stores a low-dimensional state whose repeated matrix powers generate a structured long-range convolution, and a learned gate mixes the experts using both their current predictions and their slowest block-operator mode. The module can represent multiple memory timescales without explicitly storing a long token history.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
When a neural state-space model has latent directions that are invisible under normal inputs, add a small structured carrier to the input or hidden-state update during selected training windows. The carrier changes local measurement and transition projections, analogous to the paper's carrier-dependent measurement and force projections, and can reveal modes that passive training leaves unconstrained.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add finite-horizon observability and reachability objectives to a recurrent or state-space neural model so that its latent modes are both inferable from outputs and influenceable by available inputs. This directly penalizes the failure mode identified in the paper: a large latent perturbation with nearly zero first-order output projection.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained latent ODE or recurrent update with Hamiltonian dynamics on a product of Euclidean coordinates and a Lie-algebra momentum. The momentum dynamics contain the explicit coadjoint term generated by the Lie-group structure constants, allowing the model to represent rotational or frame-dependent memory without learning this antisymmetric coupling from data.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Represent the propagation of hidden states, layer states, or optimizer states by a locally estimated transfer operator and monitor its leading eigenvalue gap. When two dominant modes undergo an avoided crossing, reduce the update scale or increase damping; after the gap reopens, restore the normal schedule. This imports the paper's sharp-but-continuous pseudo-transition mechanism rather than treating instability as a binary divergence event.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Augment a neural recurrent or state-space model with an explicit slowly varying disturbance state that absorbs contact effects, friction, hysteresis, actuator mismatch, and other systematic residuals. The network predicts nominal dynamics, while the disturbance channel provides offset-free correction without forcing the main model to memorize every operating-condition-dependent bias.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train a latent recurrent or state-space model with separate equilibrium and source-sink transition matrices instead of forcing one transition matrix to explain all latent dynamics. Use the equilibrium matrix for stationary occupancy and reversible statistics, and use a recycling matrix for directed hitting times, committors, and source-to-target flow; this should remove fixed-lag coarse-graining bias in latent world models.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
For coupled recurrent or state-space modules that represent oscillatory or periodic signals, explicitly account for communication or attention delay in the characteristic equation. Tune the coupling gain or add a phase-lead compensator so that the desired latent frequency remains a closed-loop mode instead of being shifted by small delays.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Estimate the leading complex resonances of the noise-averaged hidden-state dynamics of a stochastic RNN and use them to detect or control statistically persistent oscillations. The key design principle is to treat resonance radius and Lyapunov growth as independent signals: hidden trajectories can be Lyapunov-stable while the annealed dynamics still produce narrow-band ringing because a transfer-operator eigenvalue lies close to the unit circle.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained linear recurrent update with a two-dimensional oscillator state per hidden feature and use amplitude-dependent damping: negative damping below a target radius and positive damping above it. The cell should preserve phase information over long sequences while preventing hidden-state explosion or collapse.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or state-space network together with a periodic hidden-state trajectory, then use the Fourier-domain Hill operator of its linearized dynamics to penalize positive Floquet growth rates. The method can retain algebraic hidden-state constraints, avoiding the inaccurate practice of treating a singular descriptor matrix as invertible.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Turn a path-complete graph into a stability regularizer for a recurrent or state-space neural network whose update can switch among M learned operators. Maintain a neural quadratic or positive scalar certificate V_alpha for each graph node and penalize every graph edge that violates contraction under its corresponding operator. The resulting architecture is designed to remain stable even when the mode sequence is arbitrary rather than generated by a trained gate.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Augment an RNN or state-space model with a region-valued latent state, such as an ellipsoid or polytope, rather than propagating only a point estimate. Train every transition to map the successor region inside the predecessor-compatible region with a positive margin; this creates a neural version of the paper’s nested coder and makes long-horizon predictions robust to small parameter and input perturbations. A point prediction is decoded from the intersection of the propagated regions, while…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent block with two coupled modules: a contractive perceptual estimator and an input-to-state-stable cognitive state transition. Spectral normalization and a controlled Euler residual step enforce a quantitative gain condition, preventing hidden-state explosion while retaining long memory when the contraction factor is chosen close to one.
Useful7/10
Difficulty5/10
Novelty6/10