△ 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
✗ 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
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
✗ Mechanism failed
2026
Attach a hard control-barrier-function quadratic-program safety filter to a neural policy, but solve the filter with operator splitting and differentiate through its fixed-point map using projection Jacobian-vector products. The network learns the nominal action and task objective end to end, while the deployed action remains the feasible filtered action rather than an unconstrained penalty-based approximation.
Useful8/10
Difficulty6/10
Novelty6/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
✗ Failed on benchmark
2026
Replace a conventional recurrent hidden state with a phase oscillator state whose stored memories are exponentially stable phase-locked configurations. Each memory has a coupling matrix or low-rank coupling parameter, while an external context selects which coupling landscape is active; this separates representation storage from sequence routing.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observation Jacobian to remove from a neural latent dynamics model the component of its drift that is locally inconsistent with the observed manifold. Apply this projected drift only to generate particle proposals, and retain exact importance-ratio correction so that proposal projection improves particle coverage without changing the target posterior.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a complete tensor/Kronecker polynomial lift of a graph dynamical system with observables selected only from the support of the interaction graph. The lifted state can then be propagated by a sparse structured linear operator, while the first omitted degree is treated as an explicit residual or learned closure. This gives a graph-aware polynomial state-space layer for neural ODEs, graph RNNs, and world models.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace an unconstrained linear recurrent or state-space memory with a finite-history recurrence whose coefficients are nonnegative and sum to one. The resulting companion transition is nonnegative and row-stochastic, guaranteeing spectral radius at most one while retaining a neutral constant-history mode at eigenvalue 1.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the Gaussian trajectory predictor inside an inference-time planner or model-based reinforcement-learning policy, optimizing a nominal action sequence together with affine feedback gains against predicted disturbances. The resulting controller reacts to realized model residuals rather than relying on open-loop neural rollouts, while preserving a convex quadratic structure when the prediction map and covariance are frozen.
Useful8/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a neural latent or sequence model with a Gaussian behavior head that predicts an entire future trajectory jointly from the observed prefix and planned inputs. Instead of recursively applying only a point predictor, condition the learned joint trajectory covariance on the available prefix, producing a corrected future mean and uncertainty that incorporates temporal correlations.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition by a randomly switched composition of disk-preserving Blaschke maps. The recurrent state remains in the unit disk, while the estimated average logarithmic derivative provides a direct synchronization-versus-chaos control knob: negative transverse growth should make two states driven by the same input or map sequence synchronize, whereas positive growth should preserve sensitivity and expressive memory.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single value critic with graph-indexed critics V_alpha and graph-indexed policy heads pi_A, where the labeled graph covers every possible environment mode at every step. Train sampled Bellman inequalities rather than only equality-based temporal-difference errors, and select the policy head using the paper's min-max reachability rule. This targets robust RL settings in which the transition mode can change arbitrarily, such as unknown actuator regimes, domain randomization modes, or…
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace recurrence or nearest-neighbour analogue lookup with a learned delay-coordinate observer that continuously corrects a latent state using the current observation. Constrain the observer's closed-loop Jacobian or linear state matrix to have spectral radius below one, so prediction error contracts geometrically and required burn-in grows logarithmically with target accuracy.
Useful8/10
Difficulty5/10
Novelty6/10