✗ Mechanism failed
2026
Predict a scalar excess free-energy functional of a complete density field and obtain the direct-correlation output by automatic differentiation, instead of independently predicting each output-site value. This enforces the integrability and reciprocity constraints of a thermodynamic force field and gives a Lyapunov-like scalar that can control iterative density inference.
Useful8/10
Difficulty6/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
✗ Failed on benchmark
2026
Constrain a neural policy or recurrent dynamics model to be order-preserving, then construct upper and lower abstract transitions by evaluating monotone maps at opposite corners of each state-action cell. Train with a loss that rewards the upper abstraction for reaching safe target cells and the lower abstraction for avoiding unsafe cells, while reporting the undecided gap as a quantitative certificate.
Useful8/10
Difficulty6/10
Novelty7/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
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
✗ Failed on benchmark
2026
Use discovered infinitesimal generators to create small continuous transformations of hidden states and force a neural predictor to commute with those transformations. This converts symmetry discovery into self-supervised augmentation without prespecifying a group, canonical coordinates, or hand-designed equivariant layers.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Attach several neural vector fields to a latent representation and train them to form a closed Lie algebra rather than learning unrelated augmentation directions. The resulting generators provide data-driven continuous transformations that can be used as equivariance constraints, while bracket closure and basis-rank penalties prevent degenerate or redundant generators.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a scalar Zubov head to a neural ODE, state-space model, or recurrent world model and train it to be invariant under a discounted Koopman action. The head should be near one for trajectories attracted to the target equilibrium and near zero for states with large accumulated deviation, providing a long-horizon stability signal and an off-distribution failure detector.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a latent neural state-space model with an observable-coordinate residual that is first learned flexibly and then projected onto a constrained library of interpretable coupling terms. Train or collect data only after checking that the trajectory sufficiently excites the candidate terms; this prevents a latent model from fitting arbitrary hidden-state effects that are unidentifiable from the observations.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Modify the flow-matching denoising velocity at every integration step by the smallest Euclidean correction that satisfies a control-barrier inequality on the entire generated action chunk. Aggregate waypoint and constraint barriers with a smooth minimum, so the sampler remains differentiable and can enforce safety without retraining the action model or applying a discontinuous final-action projection.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Augment a neural dynamics model with a separately trained discrepancy predictor and calibrate an asymmetric conformal residual score. Use the resulting state- and input-dependent uncertainty set to reject, damp, or regularize neural rollouts when they leave a calibrated region, rather than treating all residual directions as equally uncertain.
Useful8/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a continuous spatial trunk and a pole-constrained modal state-space branch into a spatiotemporal predictor. The model represents a field as a sum of learned spatial modes and exponentially evolving modal coordinates, so long-horizon behavior is controlled by explicit poles rather than by an unconstrained recurrent transition matrix.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a quadratic-program safety filter to a neural policy that outputs a desired reference rather than directly replacing the underlying stabilizing controller. The filter uses a model of the complete closed-loop dynamics to make the smallest reference modification satisfying a control-barrier inequality, allowing aggressive neural behavior while preventing violations of state constraints.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use a neural dynamics model together with an online uncertainty radius to tighten rollout constraints, action bounds, or latent-state trust regions. The controller or training loop becomes conservative when the predictor is data-poor or exposed to correlated trajectories, and relaxes constraints as uncertainty shrinks. This directly transfers the paper's uniform-in-time confidence-bound and robust recursive-feasibility mechanism to neural world models and safe reinforcement learning.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Discretize the hidden state of an RNN, state-space model, or neural world model into cells and estimate a transition interval for every source-cell/action/target-cell triple from trajectory data. Use robust Bellman recursion on the resulting interval MDP to penalize actions or parameter updates whose worst-case probability of reaching an unsafe cell exceeds a prescribed threshold.
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
✗ Failed on benchmark
2026
Replace noisy pointwise derivative matching in a neural state-space model with a weak-form Koopman-generator residual. An encoder maps observations to latent observables, while a learned matrix generator propagates those observables. Integration by parts removes the need to differentiate noisy trajectories and provides a controllable noise-averaging mechanism.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Add a parallel observer state to a neural dynamical model and correct it using the residual between predicted and observed channels. Constrain the observer's projected error dynamics to remain contracting over the training-data state range, so partial observations repeatedly remove latent-state drift instead of serving only as an auxiliary prediction loss.
Useful8/10
Difficulty6/10
Novelty6/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
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
✗ Failed on benchmark
2026
Replace pointwise spectral-norm contraction in a recurrent or state-space model with an average logarithmic contraction certificate for an input-conditioned fibre update. Let a base state carry expressive, possibly noncontractive dynamics, while an auxiliary latent fibre contracts on average. This should preserve useful variability in the base while preventing long-horizon fibre explosion and making the fibre converge to an input-dependent invariant section.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a discrete-event safety shield between a partially observed neural policy and the environment. The policy proposes a forcing action, but the shield permits it only when the same decision is safe for every latent plant state compatible with the current observation; otherwise it returns a certified inconsistency or a conservative fallback. This converts forcing consistency into an implementable robust action-selection rule rather than trusting a single estimated hidden state.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Equip a learned dynamics model with an adaptive parameter estimate and an explicit component-wise uncertainty box. Require a nominal backup-policy rollout to remain inside a safety margin equal to the rollout's worst-case parameter sensitivity, producing a conservative filter for reinforcement learning and world-model planning that becomes less conservative as the model identifies its parameters.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Augment a neural state-space model or neural ODE with a low-dimensional control residual that keeps its hidden state inside a sequence of time-varying convex sets encoding temporal requirements. At each integration step, solve a small quadratic program that minimally changes the network dynamics while enforcing an inward-pointing condition on every active convex-set face, producing robustly constrained long-horizon rollouts.
Useful8/10
Difficulty6/10
Novelty7/10