✗ Failed on benchmark
2026
Replace correlation-based memory pruning in an RNN or state-space model by measuring how hidden-state history changes the response to individual past input events. Train a compressed memory coordinate only if it preserves the event-consequence kernel for the target observable, such as future loss, prediction, or control return. A memory representation is accepted when the conditional variance of this kernel within compressed-state groups is small, even if dwell-time or autocorrelation…
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Model one period of a cyclic optimizer or periodically modulated recurrent network as a discrete-time linear time-periodic system obtained by linearizing the update around its current trajectory. Estimate a periodic Lyapunov matrix sequence and scale the next learning-rate or modulation amplitude so that every phase contracts according to a certified energy decrease. This should prevent delayed divergence caused by resonance with the schedule, even when individual phase Jacobians are…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
At a learned switching hyperplane, replace ambiguous hard routing by a convexified vector field whose normal component is zero whenever neighboring vector fields point toward the surface. This gives a non-chattering approximation of Filippov sliding and can improve long-horizon integration near friction thresholds, impacts, and climate regime boundaries.
Useful8/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained graph-neural latent ODE or recurrent transition with two edge-cochain states whose linear drift is Hodge-Laplacian dissipation and whose quadratic coupling is generated by a skew-symmetric anticommutator. The coupling remains expressive while cancelling from the total energy, so the long-time envelope is determined by the Hodge spectral gap rather than uncontrolled nonlinear growth.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace pointwise prediction of the next field with prediction of a learned flux followed by a discrete divergence. Combine Fourier spatial mixing with a causal temporal kernel over the recent resolved-history slab, so the model learns finite-memory closure effects while preserving local conservation exactly under periodic or compatible boundary conditions. The architecture should reduce spurious mass drift and improve autoregressive rollout stability on coarse-grained PDE data.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace an unconstrained recurrent transition with two coupled channels: one contracts under forward iteration and the other contracts under inverse iteration. Enforcing this structure should prevent long-horizon amplification of state, numerical, and teacher-forcing perturbations while retaining nontrivial memory through the backward-stable channel.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Split a learned transition model into a contractive nominal branch and a high-capacity excursion branch, and blend them using calibrated epistemic uncertainty. The nominal branch is used exclusively in the well-supported region, while the excursion branch is activated when the current latent state leaves that region, preventing flexible model errors from being recursively amplified during ordinary rollouts.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train or evaluate a neural dynamical model using many independently restarted finite-precision trajectories instead of one very long rollout. Detect repeated hidden states or quantized state hashes and terminate a segment before its digital transient-plus-period scale, preventing duplicate futures from dominating Lyapunov, loss, and long-horizon forecast estimates.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single recurrent state update with fast feature relaxation, activity evolution, and a slow adaptive state that modulates the activity vector field. Tune the activity subsystem near a controllable saddle-node so that it retains a useful transient regime for a predictable number of steps, enabling delayed switching and long-horizon memory without requiring a large hidden state.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the fixed-strength measurement correction in a recurrent neural state-space model with a locally normalized correction whose amplitude is inversely proportional to the operator norm of the learned measurement Jacobian. This prevents highly sensitive learned representations from amplifying latent-state errors and should make long-horizon filtering and rollout behavior substantially less dependent on representation scale.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Equip a recurrent, state-space, or graph neural network with a ring or graph Fourier mode monitor that detects which spatial mode is approaching a delay-induced oscillatory instability. Use the mode-specific characteristic equation to impose a gain or delay trust region, or deliberately tune one mode to create controlled traveling-wave memory rather than allowing uncontrolled oscillations. This transfers the paper's symmetry-sensitive bifurcation machinery into a measurable training-time and…
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a rare-probe channel to a recurrent or state-space model and measure its local growth around every attractor reached by the same parameters. Penalize the worst attractor-conditioned growth rate, rather than checking stability only along one training trajectory, so a model cannot appear stable in one regime while exhibiting exploding perturbations in another. The method is especially appropriate for long-horizon RNNs, neural ODEs, and autonomous world models with recurrent hidden dynamics.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace uniformly spaced history taps in a neural state-space encoder with a fixed or learned set of non-uniform delays. Regularize the resulting delay-observation matrix to have a large smallest singular value, which makes latent-state reconstruction less sensitive to irregular timestamps and observation noise. This is directly applicable to event-based data, missing timestamps, and systems with multiple time scales.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap an observation-based neural policy with a real-time safety filter that accounts for uncertainty in its latent-state estimate. The policy proposes an action, while a quadratic program minimally modifies that action so a control-barrier/value function remains nonnegative for every state inside a conformally calibrated error set.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a latent continuous-time neural model with dynamics \(\dot{z}=Az+f_\phi(z)\), where \(f_\phi\) is known, separately computed, or frozen, and \(A\) is learned exclusively from the derivative residual after subtracting \(f_\phi(z)\). Parameterize \(A\) with a truncated SVD or low-rank factorization so its eigenvalues directly predict local stability and long-horizon growth.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train and select neural ODE architectures using parameter sensitivities and Fisher information, so that a model is penalized or rejected when different parameters produce nearly indistinguishable trajectory effects. The neural component remains inside the ODE vector field, but its width, depth, and parameterization are selected using predictive error together with the smallest Fisher-information eigenvalue, effective rank, and confidence intervals.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent generator with a skew-adjoint block lift whose projected first channel implements a non-skew effective generator. The hidden state evolves unitarily in the enlarged space, preventing exponential norm blow-up, while the projection can express transient amplification, damping, and non-normal dynamics unavailable to a purely orthogonal recurrent matrix.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace a generic first-order predictor for an aggregate observation with a second-order observable-reduced dynamics module derived by eliminating hidden active and quiescent compartments. Train a neural network only for the unknown growth function while enforcing the exact coefficient structure induced by switching rates, so the model cannot exploit a trajectory-fitting but mechanistically incorrect latent representation.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace arithmetic averaging of local latent means or covariances by diffusion of Gaussian natural parameters. Each asynchronous encoder contributes its local observation information, while graph diffusion combines complementary information from agents that individually observe only subsets of the latent state. The fused latent posterior can then drive a recurrent world model, graph neural network, or decentralized multi-view predictor.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace direct action imitation with a causal recurrent estimator of the inverse input gain. The neural network predicts the latent quantity needed by the expert controller, and a fixed algebraic wrapper converts that prediction into an action using the measured state difference and tracking error, thereby removing the additive disturbance exactly under the sampled timing model.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary modality-specific residual fusion with a switched observer whose latent correction depends on the currently available channel. The individual channels are allowed to be insufficient to reconstruct the latent state; stability is enforced over the full switching cycle, so complementary intermittent observations can jointly maintain a stable representation.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a finite nondeterministic abstraction of an RNN or neural state-space model by partitioning its hidden-state domain into cells and adding every abstract transition that could contain a concrete successor. Use temporal-logic counterexamples to refine only cells involved in violating paths instead of globally increasing discretization resolution. This provides a falsifiable bridge between long-horizon neural dynamics and formal safety or attractor analysis.
Useful8/10
Difficulty7/10
Novelty8/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 confirmed, baseline not beaten
2026
Add an explicit unknown-frame variable to a recurrent world model or multimodal sensor-fusion network, and train it only on temporal windows whose latent motion provides enough excitation to identify that frame. The model should use a two-view or multi-view consistency loss and an adaptive gate based on the smallest singular value of the window Jacobian, preventing optimization from confidently fitting geometrically ambiguous trajectories.
Useful8/10
Difficulty6/10
Novelty7/10