✓✓ 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
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
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 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
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
Wrap a recurrent, state-space, or implicit neural layer in an explicit structured uncertainty model for parameter drift, channel-wise gain error, quantization, or measurement noise. Train the layer to maintain a structured-singular-value margin, which can be substantially less conservative than an unstructured spectral-norm bound while correctly accounting for cross-channel coupling introduced by coordinate changes or feature mixing.
Useful7/10
Difficulty7/10
Novelty7/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
✓✓ 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
Use the paper's lifetime law as a controller for training or rollout difficulty. Estimate the active perturbation bandwidth R of hidden states or forecast errors and reduce the residual gain, increase the dispersion order W, or inject controlled bandwidth whenever the estimated prethermal lifetime becomes too short.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace the recurrent transition by a dissipative linear state update minus a maximal monotone nonlinear damping operator. Couple the hidden-state update to an output map so that the cell satisfies a discrete analogue of the paper's scattering-passivity inequality, controlling both hidden-state energy and output energy by initial-state energy plus input energy.
Useful7/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained one-step transition network with a symmetric damping–symplectic-core–damping composition. The damping strength is one learned scalar rate and is applied through positive exponential diagonal factors, so every step has a known contraction law while the neural core models nonlinear conservative transport.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a neural controller as a uniformly accurate surrogate of a trusted but expensive controller, and use a measured small-gain condition to decide whether the surrogate is safe for closed-loop deployment. The approximation tolerance becomes an interpretable residual-state budget instead of an opaque validation metric.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a recurrent or continuous-depth block from a dissipative vector field and project every state derivative onto the tangent cone of a closed convex hidden-state set. Unlike ordinary clipping, tangent-cone projection removes only the outward component at the boundary and preserves admissible motion. Under the paper's maximal-dissipativity result, the continuous flow is nonexpansive in its initial state.
Useful6/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace one deterministic residual update with a short cyclic composition of learned vector fields evaluated for randomized, short run times. Because finite compositions of noncommuting flows generate directional-derivative and Lie-bracket terms, changing the cycle order gives the network an explicit, low-cost way to learn drift directions that are unavailable from the individual vector fields alone.
Useful6/10
Difficulty5/10
Novelty7/10