✓✓ 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
△ 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
△ Mechanism confirmed, baseline not beaten
2026
Replace explicit Runge-Kutta integration in a neural ODE or probability-flow ODE sampler with the anchored two-derivative method. Each stage uses both the neural vector field and its total time derivative, while the coupled implicit solve is designed so the accepted map has an L-stable Padé stability function. The method should allow larger steps on stiff trajectories without amplifying fast decaying modes.
Useful7/10
Difficulty7/10
Novelty7/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
✗ Mechanism failed
2026
Replace or augment a recurrent hidden coordinate with a nonnegative bistable autocatalytic state driven by an external control signal. The cell retains information through metastable low and high states, while a periodic or slowly varying control produces a controlled phase lag and hysteresis useful for temporal regime detection. Explicit noise can be injected to test whether it enhances switching near the predicted intermediate-frequency regime.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace independently parameterized scalar, vector, and higher-order neural outputs with consecutive spaces of ReLU-power differential forms linked by an exact exterior-derivative layer. The network can then produce curl-free, divergence-free, or more general closed fields by construction, while the complex prevents artificial null-space modes that commonly appear when differential constraints are enforced only through sampled residual losses.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural policy against task cost while penalizing its induced drift mismatch from a reference policy or offline-data dynamics model. Unlike action-space behavior cloning, the penalty weights deviations by the inverse diffusion covariance, so deviations in highly noisy directions are cheap and deviations in predictable directions are expensive. This gives a principled interpolation between reference preservation and task optimization.
Useful7/10
Difficulty5/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
✗ Failed on benchmark
2026
Attach uncertainty to neural value targets by estimating the empirical one-step Bellman perturbation and propagating it through the discounted closed-loop transition operator. Use the resulting uncertainty to downweight high-variance Bellman targets or regularize the critic toward conservative predictions, especially in offline or model-based reinforcement learning.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Wrap a neural multi-agent policy with an analytic planner that generates turn-straight trajectories tangent to pursuer surveillance disks, then selects the branch with the smallest predicted completion time. The network supplies high-level preferences or residual corrections, while the geometric layer prevents unnecessarily entering exclusion regions and exposes an explicit branch-switching signal for training.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural policy against a simulator using an adaptive constraint set formed from the worst violations, rather than uniformly averaging all rollouts. At each round, identify the trajectory with the largest normalized safety violation, add its state-time features and violation margin to a surrogate barrier or penalty model, and fine-tune the policy until the surrogate constraints are satisfied. This should reduce the gap between nominal validation risk and rare-event failure risk while…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Wrap a neural policy or neural dynamics model in a short-horizon predictive optimizer that enforces explicit bounds on a learned interaction variable before applying the next action. This separates disturbance rejection and tracking from safety: the network may propose aggressive corrections, but the optimizer projects them onto actions whose predicted force, state, and actuator trajectories remain feasible.
Useful7/10
Difficulty6/10
Novelty5/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
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition or latent ODE vector field with a port-Hamiltonian update whose metric is positive definite and whose interaction operator is skew-symmetric. Use an implicit midpoint step so the quadratic latent energy is preserved exactly in the unforced, constant-metric case, preventing long-horizon drift while retaining learnable nonlinear interactions.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a neural local reconstruction into a finite-volume or graph-based simulator, but hard-cap its contribution so every reconstructed state remains in the physical admissible set. The network learns accuracy-sensitive gradients or stencil weights; a deterministic limiter, rather than a penalty loss, guarantees positive density and pressure for arbitrary network outputs.
Useful7/10
Difficulty5/10
Novelty7/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
✗ Failed on benchmark
2026
Insert a slow routing state and an intermediate hysteresis variable between a neural memory and its next-state selector. The hysteresis prevents small prediction fluctuations from repeatedly changing the active attractor, while the slower router learns transition probabilities independently of the attractor parameters.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace additive Euclidean stochastic residual updates with tangent-space updates followed by the Riemannian exponential map. A neural drift network produces a tangent vector, while noise is sampled using the metric induced by the inverse diffusion tensor; the resulting layer is invariant to smooth coordinate reparameterizations up to numerical integration error.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's localized truncation residual as an online certificate for whether the current polynomial lift is expressive enough. Start with a low-degree edge lift and activate additional degree blocks or a learned closure only when the residual exceeds a calibrated threshold, avoiding the cost and instability of always using a large polynomial dictionary.
Useful7/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build an autoencoder whose decoder outputs a monotone quantile function rather than an unconstrained spatial field. The latent representation can be compressed with POD or a neural bottleneck in CDT space, while the decoder guarantees valid transport maps and therefore avoids negative densities, mass drift, and spurious oscillations common in unconstrained reduced-order neural decoders.
Useful7/10
Difficulty5/10
Novelty6/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