✗ Mechanism failed
2026
Cluster recurrent modules or MoE experts by the geometry of their observed finite-horizon input-output behaviors rather than by parameter distance. Train one shared optimizer/controller or low-rank adapter per cluster while retaining module-specific parameters and routing. This should reduce control and optimizer overhead without merging modules whose temporal responses are dynamically incompatible.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Train a latent state-space neural network so that its effective pole geometry remains consistent when identified by low-frequency moments and finite-window trajectories. Penalize disagreement between the two reductions, and penalize proximity to the oscillatory/non-oscillatory boundary, to reduce spurious ringing after distillation or context truncation.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Represent a small neural state-update map or optimizer update by polynomial constraints and certify decrease of a polynomial Lyapunov function on the nonnegative activation or state region using successive Parrilo SOS levels. Use the monotone shift-threshold construction to distinguish genuine instability from failure of a weak certificate, and raise the SOS level only when necessary.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or equilibrium neural layer as a discrete dynamical system and explicitly prevent its dominant Jacobian multiplier from crossing -1. The guard targets the specific period-doubling instability identified by the paper, rather than merely shrinking all weights or imposing generic contractivity.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace vector-valued Hopfield neurons by SU(d)-valued latent states and construct Hebbian couplings from matrix memories. Recall is performed by iterating toward the dominant eigenmode of the induced lifted coupling operator, with each iterate projected back onto SU(d); the larger matrix representation should reduce random crosstalk and increase critical memory capacity.
Useful8/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Apply interval Krawczyk certification to the augmented equations for a recurrent-network fixed point and a singular state Jacobian. This produces a rigorous local certificate for the gain or feedback value at which two fixed points merge or disappear, allowing training or inference to avoid parameter boxes containing an uncertified fold.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Construct a spatial recurrent network whose local vector hidden state has two stable attractors and whose neighbor coupling is diffusive. Train or constrain the network so that the desired attractor invades the undesired one with a controlled positive front velocity, rather than relying on a scalar class-frequency variable that can erase depletion and interface structure.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a sensitivity-aware stability monitor and regularizer to an RNN, neural state-space model, or linearized sequence model. Instead of evaluating the model at many perturbed inputs or parameter settings, estimate how each perturbation changes the dominant eigenvalues of the local hidden-state Jacobian, then penalize perturbations predicted to push eigenvalues toward the unit circle. This should improve long-horizon behavior while identifying a quantitative perturbation radius at which…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a parallel observer state to a neural dynamical model and correct it using the residual between predicted and observed channels. Constrain the observer's projected error dynamics to remain contracting over the training-data state range, so partial observations repeatedly remove latent-state drift instead of serving only as an auxiliary prediction loss.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace the transition function of a latent world model, recurrent state-space model, or neural ODE with a learned Hamiltonian flow. The network predicts a scalar latent Hamiltonian, while a symplectic integrator generates future states, preserving canonical phase-space structure and suppressing artificial long-horizon energy drift.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Give a single spiking layer a persistent vector-valued apical compartment that stores the current online linear predictor for the task. On each labeled context pair, its subthreshold state performs a leaky LMS update; on the query, the state is read without updating, allowing in-context adaptation without attention or inference-time synaptic plasticity.
Useful8/10
Difficulty5/10
Novelty7/10
✗ 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 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 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
✗ 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
✗ Mechanism failed
2026
Build a recurrent or state-space network from heterogeneous dynamical modules and characterize each module through sampled frequency-response passivity and Davis–Wielandt shell bounds. Constrain inter-module coupling so that the composed frequency response retains a positive passivity margin, providing a model-based alternative to blindly shrinking all recurrent weights.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Use localized feedback on one hidden unit or graph node to break a globally coherent period-two oscillation. This transfers the paper's control result that, under suitable connectivity, anchoring a single agent can destroy a network-wide oscillatory mode without directly modifying every state.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Expose a recurrent model to deliberately designed input pulses or latent-state perturbations instead of training only on passive trajectories. Choose perturbations that maximize the smallest eigenvalue of the accumulated feature Gramian, making otherwise indistinguishable recurrent couplings recoverable and reducing uncertainty in long-horizon predictions.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Train a small encoder and latent Koopman predictor to forecast whether a neural sequence model will enter a high-error or high-instability region, then execute an expensive refinement block only when the forecasted risk exceeds a threshold. The base model remains active at every step, so the learned preview model controls computation rather than directly replacing the main predictor. Add a bounded-rate interpolation when the gate switches off, preventing abrupt changes in recurrent state or…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use interval outer enclosures and branch decomposition to detect all plausible fixed-point branches of an equilibrium network over an operating-domain box, instead of selecting whichever equilibrium a single initialization reaches. Penalize training configurations that produce unresolved or excessively wide equilibrium sets, and expose branch multiplicity as a measurable operating-regime signal.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Equip a neural state-space model with several candidate latent transition modes and a disturbance-aware residual detector. The detector attributes persistent prediction error either to an exogenous disturbance or to a changed transition operator, and switches or blends the model mode only when the evidence exceeds a calibrated threshold.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or equilibrium network as a feedback interconnection of heterogeneous blocks, certifying some blocks through induced-gain bounds and others through phase or sector bounds. This avoids imposing a uniformly small Lipschitz constant on all blocks: dissipative or strongly contractive blocks use gain certificates, while approximately skew, oscillatory, attention-like, or state-space blocks use phase certificates. The network is accepted only when the local certificates satisfy the…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Use a two-stage residual augmentation loop: first let a residual network explain model mismatch, then project its learned vector field onto a physically constrained candidate library and replace the flexible residual with the accepted sparse terms. This turns an unconstrained neural correction into a low-complexity dynamical law that is easier to roll out over long horizons and can expose unsupported hidden-state explanations.
Useful7/10
Difficulty5/10
Novelty6/10