✓✓ Beats tuned baseline
2026
Replace a purely nonlinear recurrent transition with a learned observable map followed by an explicitly linear latent evolution model. Include the original latent state and a small set of nonlinear observables, and update the linear transition online with forgetting-factor recursive least squares when the environment or task dynamics change.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use the paper's below-threshold bistability mechanism to distinguish local stability from actual recovery: a recurrent network may have a locally stable nominal state while a second stable state still captures trajectories. Add a perturbation-based basin test and retain stronger damping or reset actions until the network demonstrably returns to the desired branch, rather than disabling intervention immediately when the spectral threshold is restored.
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
✓✓ 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
✓✓ 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
Represent each neural module as a Hamiltonian storage system and connect modules through a state-dependent skew or Dirac interconnection instead of arbitrary residual additions. The coupling may change with the hidden state, but its internal power contribution cancels exactly, so total stored energy is controlled only by external inputs and explicitly added dissipation.
Useful8/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace a point hidden state in a recurrent or state-space neural network with a zonotope representing all latent states consistent with bounded process and observation errors. Propagate the zonotope through the learned dynamics and intersect it with the set implied by the next observation, producing a corrected uncertainty tube rather than an unconstrained open-loop hidden trajectory. This should improve long-horizon prediction under distribution shift and expose a sharp failure boundary when…
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition with a decaying symmetric memory operator plus a skew-symmetric rotational operator. The skew component creates phase-shifted cross-channel memory and can represent oscillatory or circulatory temporal dependencies without requiring eigenvalues with large positive real parts.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace a standard mixture-of-experts router or recurrent transition-mode classifier with a gate whose logits are adapted by the robustness of temporal safety specifications. Experts represent distinct dynamical regimes, while robustness increases the probability of experts whose predicted trajectories satisfy the specification and suppresses modes producing imminent violations. This should improve mode switches and long-horizon rollout quality precisely near safety-critical transitions.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Represent a recurrent or residual network as a linear state update driven by a memoryless activation or feedback nonlinearity, then solve a data-driven quadratic Lyapunov SDP using excitation trajectories. Accept an update or parameter checkpoint only when the certificate proves contraction and bounds the disturbance-to-output gain. This should prevent exploding hidden states and give a measurable transition between stable and unstable recurrent dynamics.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace full-state prediction in a neural simulator or neural operator with prediction of a perturbation around a cheap structured background trajectory. Compute the background defect and known linearized or nonlinear corrections explicitly, and let the neural closure model only the remaining residual. Add a residual-magnitude gate so the learned closure is suppressed when the structured solver already explains the target dynamics.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace repeatedly applied unconstrained message passing or recurrent transition maps with a transport layer containing a coherent hopping branch and an explicit dephasing operator. Small dephasing preserves sharp, oscillatory propagation, whereas large dephasing suppresses inter-position correlations and produces stable diffusion-like receptive-field growth, which should reduce long-horizon ringing and exploding sensitivities.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a neural feedback law together with explicit well-posedness barriers, then certify the resulting closed loop using a common quadratic Lyapunov and activation-sector certificate. The controller is deployed only if the certificate proves exponential decay or a discounted quadratic-cost bound, converting training into a falsifiable stability-constrained synthesis procedure.
Useful8/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained neural flux Jacobian with a matrix of the form \(A(u)=H(u)^{-1}S(u)\), where \(S(u)\) is symmetric and \(H(u)\) is the positive-definite Hessian of a strictly convex entropy. Because \(A(u)\) is similar to a symmetric matrix, every characteristic speed is real. Reconstruct the flux by integrating this Jacobian along a fixed path from a reference state, and use the resulting module inside a differentiable finite-volume solver or learned dynamical model.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent or state-space transition with a finite set of mode matrices selected by a Markov routing process, while explicitly constraining the associated Kronecker operator to have spectral radius below one. This targets exploding hidden-state variances caused by rare but repeatedly visited unstable modes, a failure mode not detected by average spectral radius or ordinary Lyapunov stability.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use a cyclic forward-neighbor recurrent or state-space layer and regularize its coupling so selected discrete Fourier modes are contracting while task-critical modes remain weakly damped. The paper's exact mode factors make instability falsifiable: a mode becomes unstable when its scalar factor changes sign, producing a measurable transition rather than a vague smoothness prior.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Use the conformal regularity inflation law as a controller for observation placement or neural-ODE solver refinement. Sample or evaluate the learned dynamics more densely only where the predicted continuous-time uncertainty exceeds a prescribed safety radius, rather than using a uniform time grid.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace unconstrained residual blocks by a nonautonomous linear backbone plus a learned nonlinear perturbation, and constrain the perturbation gain using the Green operator of the backbone. The resulting network can contain both contracting and expanding channels, but the accumulated response of the perturbation remains bounded when its Green margin is below one. A differentiable or periodically updated estimate of this margin becomes both an architecture constraint and a training monitor.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a stack of independently parameterized residual or MLP blocks with a small latent grid or vector repeatedly updated by one shared transition rule. Let the number of updates depend on the current latent state, so easy examples terminate early while hard examples receive more computation, potentially improving parameter efficiency and extrapolation.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Initialize latent coordinate-frame parameters analytically from two temporally separated neural predictions instead of starting joint optimization from arbitrary translation and orientation. This removes the continuous gauge before backpropagation and should prevent EKF-like or gradient-based failures caused by large yaw and position initialization errors.
Useful7/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Augment a recurrent or state-space neural model with two predictors: an absolute predictor using raw command and output histories, and an incremental predictor using differences. Use the absolute prediction residual, projected onto an offline-learned mismatch subspace, to estimate persistent actuator bias or dead-zone effects and compensate the next command or latent transition. The incremental branch provides a diagnostic because a constant mismatch should vanish there while the absolute…
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent or neural-operator latent transition with a differentiable KPZ cell acting on a spatial latent field. The cell explicitly separates smoothing, nonequilibrium nonlinear steepening, and stochastic forcing, making it suitable for driven dissipative systems and long-horizon roughening that generic networks may fail to reproduce.
Useful7/10
Difficulty6/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