△ Mechanism confirmed, baseline not beaten
2026
Apply the paper's compositional PAS idea to recurrent or state-space networks by propagating a polytope of possible hidden states and input perturbations over multiple time blocks. Instead of validating one hidden trajectory at a time, maintain a trusted convex family and re-linearize only when its nonlinear-fidelity tolerance is exceeded. This creates a runtime monitor and adaptive horizon mechanism for long-sequence inference, forecasting, and learned world models.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Treat the optimized surrogate and the training trajectory as objects that require a decision-level audit. Use multistart optimization to count phantom optima, and periodically evaluate whether stochastic training has changed the surrogate optimum even when validation prediction error remains nearly constant; stop, roll back, or average checkpoints when decision drift exceeds a threshold.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Train a neural controller or learned dynamics model against a finite-horizon set-valued certificate rather than only sampled trajectories. Represent uncertain states and bounded disturbances with hybrid zonotopes, propagate them through affine dynamics and a piecewise-linear neural network, and penalize reachable-set violations and failure to contract into a terminal set. This turns rare worst-case failures into a directly optimized geometric objective.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a conventional linear decoder in an autoencoder or latent state-space model with an explicit quadratic manifold decoder, allowing a small latent vector to represent curved and transport-like state trajectories. Add a dynamics-aware invariance loss that penalizes the discrepancy between the time derivative of the quadratic manifold and the neural dynamics evaluated on that manifold.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Build a continuous-time RNN or neural state-space model whose latent dynamics possess two stable periodic attractors representing persistent sequence modes, then inject weak calibrated noise to induce rare transitions between them. Instead of treating mode switching as an arbitrary classifier event, estimate the minimum transition action and tune the noise level or an explicit control input so that the observed switching rate matches the desired rate. This should improve long-horizon multimodal…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Constrain a recurrent neural transition to map a compact learned-state region strictly into its interior, creating a neural analogue of the paper's maximal attractor. Unlike simple spectral normalization, this permits a nontrivial invariant set and can preserve task-relevant recurrent dynamics while preventing long-horizon state escape.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Attach a deterministic supervisory automaton to a neural policy or sequence model and mask every event disabled by the current supervisor state. Use a short receding-horizon planner over admissible events to resolve conflicts between neural preferences and shared-resource constraints. The network scores useful actions, while the automaton supplies an exact safety layer.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a fixed-size random transition gate with a risk-calibrated gate whose test count is chosen from the estimated probability of a critical event and the cost of shipping a model that misses it. The gate should combine ordinary i.i.d. rollouts with planner-generated probes aimed at high-cost boundaries, because uniform sampling can make a dangerous model appear perfectly accurate.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Pair a neural latent dynamical system with a reference latent system driven by the same external input, and train a coupling or controller so that a synchrony residual converges to zero. The target is transverse stabilization of a behavior-equivalence manifold rather than pointwise tracking of one selected trajectory or equilibrium.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Add an exact backward-conditioning module to a neural state-space model so trajectories satisfy a terminal label, target set, initial-state restriction, or prescribed event count without rejection. The module computes a backward feasibility message and reweights each neural transition toward states that can still satisfy the constraint, producing a conditioned process equivalent to a Doob transform. For large latent spaces, the exact message can be approximated by a value network and its…
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Use a neural policy only to generate a nominal action, then project that action onto the set satisfying a high-order control-barrier inequality derived from a smooth obstacle-distance function. This preserves the policy's behavior away from obstacles while enforcing a forward-invariant safety region near obstacles, and it can be used either as an inference-time shield or as a differentiable training layer.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train a neural value or latent-dynamics model with temporal-difference targets before enforcing a stiff differential-equation residual, and ramp the physics weight only after the critic has become predictive. For a stochastic dynamical model, the residual is computed using the infinitesimal generator, while terminal, safe, and failure boundary conditions are imposed through separate penalties.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add an observability regularizer to a recurrent state-space model or world model so that short sequences of predicted multimodal observations identify the latent state. The regularizer penalizes poorly conditioned Fisher information, preventing the model from storing important state variables in directions that its available observations cannot distinguish.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Train a neural controller or latent dynamics model together with a finite abstraction whose cells and successor relations are optimized using a smooth reverse-simulation surrogate. Penalizing concrete-to-abstract mismatch should suppress locally inconsistent or overly expansive latent transitions, while a separate reachability containment check preserves soundness. This creates a verification-aware training signal that targets spurious branching rather than only one-step prediction error.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Add an auxiliary prescribed-performance observer to a recurrent or state-space neural network so that latent prediction errors are estimated from observable output residuals rather than relying only on backpropagation through long histories. The observer uses a transformed normalized innovation and gains that change with the desired error envelope, allowing fast early correction without permanently using a large unstable gain. It can operate online during inference or provide an auxiliary…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Wrap a neural policy or sequence-model controller with an online-estimated ultra-local model of a scalar safety output, such as distance-to-obstacle, queue length, battery margin, or constraint slack. Estimate the unknown drift and control effectiveness directly from recent observations, then impose a robust control-barrier constraint that subtracts an empirical uncertainty envelope before allowing the neural action.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace pointwise hidden-state distance penalties with a trajectory metric that measures the largest discrepancy over a short rollout. This directly controls transient amplification: two nearly identical states are considered unstable if their predicted trajectories separate at any intermediate time, even when they happen to reconverge at the final step.
Useful7/10
Difficulty3/10
Novelty6/10
✗ Mechanism failed
2026
Train an input-generation policy or differentiable signal parameterization to produce trajectories that cover the joint input-state feature space while remaining informative for every plausible neural world model. Replace single-model experiment design by an expectation over an ensemble of models, and optimize this objective with stochastic model and trajectory samples.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an oversized recurrent hidden state or raw history stack with a causal filtered input-output lift followed by an SVD-selected bottleneck. The actor, critic, and Bellman regression operate only on the identifiable memory coordinates, preventing deterministic null directions from being fitted as if they were independent state variables.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a static or uniformly random PINN collocation distribution with points generated by rolling out the model's own local feedback dynamics. For a learned scalar field V_theta(x,t), compute a control and adversarial direction from grad_x V_theta, integrate the physical dynamics forward, add controlled Gaussian exploration, and train on the resulting points together with a small uniform reservoir. This should concentrate samples near reachable boundaries, large-residual regions, and…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
For systems with a repeating orbit, train a periodic neural dynamical model together with a return map whose transverse deviations contract after each period. Enforce and measure orbital contraction rather than requiring phase-aligned pointwise trajectories to remain close, allowing phase drift while suppressing divergence across many cycles.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the reachable-safe-set viewpoint to make training data generation adaptive: maintain an approximation of the states reached by the current neural policy, identify boundary regions with weak barrier margin, and sample there until the set is sufficiently covered. This replaces random rollout expansion with a measurable coverage condition that can support finite-sample safety claims.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use PAC-certified sampling to estimate whether a neural transition model has adequately covered the reachable successor set of each latent-state cell. Cells with insufficient coverage receive additional rollouts, larger uncertainty margins, or increased training weight. This prevents a model from appearing stable merely because rare but dynamically important transitions were never sampled.
Useful7/10
Difficulty5/10
Novelty7/10