✓✓ Beats tuned baseline
2026
Use a neural network to predict an operating point or latent state, then pass it through a sparse differentiable implicit layer that solves governing nonlinear equilibrium equations. This replaces soft physics penalties with an exact or tightly solved equality projection and can be combined with primal-dual inequality handling and deterministic restoration.
Useful9/10
Difficulty7/10
Novelty5/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 the standard unit-step modern Hopfield retrieval update with a relaxed step using theta greater than 1, while restricting theta to the theoretically safe interval (0,2). The relaxed map has the same fixed points as ordinary attention and provably decreases the Hopfield energy, so it can move farther toward an attractor per iteration without changing the retrieval objective.
Useful8/10
Difficulty3/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
Represent a scalar energy or free-energy functional of a three-dimensional neural field using translation- and rotation-equivariant convolutions, and produce the field prediction by minimizing the total functional rather than by a direct decoder. The same functional can then generate equilibrium states, forces, and response observables under new external fields, resolutions, and system sizes.
Useful8/10
Difficulty7/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 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
✓✓ Beats tuned baseline
2026
Add a differentiable uncertainty state to a learned world model and optimize action sequences using both predicted task reward and the covariance of the latent or target-state estimator. The policy should move or attend toward states that make observations informative, rather than selecting actions only from mean-state predictions.
Useful8/10
Difficulty6/10
Novelty6/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 per-eigenvector spectral supervision on symmetry-forced multiplets by a projector-trace target determined from the operator family's commutant. Use individual eigenvalue or eigenvector targets only outside detected forced blocks, avoiding arbitrary basis choices and exploding gradients at protected crossings.
Useful8/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Represent a neural controller as the projection of a learned Hamiltonian stable manifold rather than learning a state-to-action map without geometric constraints. Train a manifold chart together with its invariance equation, and reject or branch-switch near points where the manifold projection becomes singular. The resulting controller exposes a measurable boundary between single-valued smooth feedback and multivalued or hysteretic feedback.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Wrap the nominal forward or optimization dynamics of a neural network in a propagated uncertainty tube representing bounded disturbances in activations, gradients, or parameters. Penalize or reject updates whenever the tube radius exceeds an allowed task-dependent margin, thereby converting the paper's robust path-following construction into a contraction-aware training rule.
Useful8/10
Difficulty5/10
Novelty6/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
Construct a recurrent or graph-recurrent layer with a homeostatic feedback variable and set its recurrent gain using the graph degree-moment ratio \(\alpha=\langle k^2\rangle/\langle k\rangle\). The feedback loop is deliberately placed below, near, or above a predicted Hopf boundary, allowing controlled persistent oscillations without unconstrained exploding states.
Useful8/10
Difficulty5/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
Construct a prescribed-performance funnel directly from state-only demonstrations, then train a state-feedback neural network whose output is bounded and whose gain is optimized to keep the tracking error inside that funnel. The controller should not imitate actions; it should reproduce the demonstrated transient and steady-state error geometry while explicitly reducing feedback authority whenever actuator saturation would make the funnel infeasible.
Useful8/10
Difficulty6/10
Novelty7/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
Use a consensus-coupled optimizer for replicated model parameters, but construct every communication perturbation so that the all-ones consensus direction remains in the Laplacian null space. This prevents topology noise, pruning, or heterogeneous communication weights from changing the common parameter trajectory while still allowing disagreement modes to be damped.
Useful8/10
Difficulty5/10
Novelty6/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
Replace uniform graph-convolution aggregation with a distance-aware message transform whose strength decays as \(\gamma^k\). At hop \(k\), transform the learned local evidence with \(2\operatorname{artanh}(\gamma^k z)\) before summation, so distant nodes have a provably shrinking influence window rather than accumulating unbounded noisy evidence.
Useful8/10
Difficulty5/10
Novelty6/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