✗ Mechanism failed
2026
Use a conditional normalizing flow to replace inner-loop MCMC when sampling states or parameters under progressively tighter neural energy or likelihood constraints. The flow is trained online from recent live sets, and proposals are corrected by importance weighting and resampling, so flow bias does not directly corrupt the nested estimate.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Attach a learned nonnegative storage function to a neural state-space model and penalize violations of a strict dissipativity inequality during rollout training. The resulting telescoping inequality limits cumulative output deviation and provides a monitor for whether long-horizon simulations are entering a stable turnpike regime.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or neural state-space model on fixed-initial-state subsequences, but select the training horizon and burn-in from an empirically estimated turnpike bound instead of choosing them arbitrarily. If the cumulative discrepancy between fixed-initial-state and free-initial-state optima is bounded, the average discrepancy decreases as 1/N, allowing shorter windows while preserving the long-horizon optimum.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Train an encoder-decoder world model together with a latent transition map, but certify latent attractors only when the learned model is approximately semiconjugate to the observed high-dimensional dynamics with residual below the isolating-set margin. Compute a Conley-Morse graph on a latent grid and lift each certified recurrent component through the decoder to obtain a region in the original state space where an attractor or invariant set is predicted to exist.
Useful8/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Train a latent state-space neural network so that its effective pole geometry remains consistent when identified by low-frequency moments and finite-window trajectories. Penalize disagreement between the two reductions, and penalize proximity to the oscillatory/non-oscillatory boundary, to reduce spurious ringing after distillation or context truncation.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a neural policy together with a positive neural Lyapunov function so that the learned closed-loop transition decreases the function at every sampled state in a prescribed operating region. This converts policy learning from an unconstrained reward problem into a constrained dissipativity problem and provides an inference-time monitor that can reject or damp actions when the certificate is violated.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace ordinary topology-sensitive message passing with scalar-gated aggregation followed by an explicit correction that aligns local node states with a graph-wide consensus component. The correction should make node embeddings less sensitive to line or edge removals while preserving local information needed for prediction. This is suitable for graph neural networks and graph-based world models exposed to changing graph sizes or sparsity patterns.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace or augment a deterministic recurrent hidden state with a stochastic Markov transition, then explicitly measure its entropy production and output memory time. Penalize operating points where the target changes faster than the hidden state can track at the available dissipation, while allowing the model to satisfy the bound either by increasing transition activity or by developing a longer-lived memory mode.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Train or initialize a Lyapunov certificate for a recurrent, state-space, or neural-ODE model on an inner set, then actively discover a larger stable state envelope instead of assuming that the certificate generalizes out of distribution. A Gaussian process models the signed stability margin or binary long-horizon outcome, and new simulations are selected where posterior uncertainty and proximity to the estimated boundary are both high.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace pointwise differential PINN residuals with integral residuals tested against smooth functions, so the network can represent shocks without requiring derivatives of a discontinuous prediction. Add a one-sided entropy penalty to select the physically admissible weak solution rather than an arbitrary shock or rarefaction solution.
Useful8/10
Difficulty5/10
Novelty7/10
✗ 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
✗ 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
✗ 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
✗ Mechanism failed
2026
Replace the transition function of a latent world model, recurrent state-space model, or neural ODE with a learned Hamiltonian flow. The network predicts a scalar latent Hamiltonian, while a symplectic integrator generates future states, preserving canonical phase-space structure and suppressing artificial long-horizon energy drift.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace a monolithic nonlinear latent transition in a neural world model or sequence predictor with two lifted latent channels: a global channel encoding scene-wide or sequence-wide structure and local channels encoding patches, segments, tokens, or objects. Propagate both channels with a block-structured linear operator and decode them jointly, so the encoder remains nonlinear but multi-step latent rollouts do not repeatedly apply a deep transition network.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Attach two independent critics to a learned controller: an empirical probability that executing the controller reaches a desired terminal set, and a recoverability value estimating whether the current state remains inside a safe reach-avoid region. Execute the learned controller only when both critics pass their thresholds; otherwise route to a conservative fallback policy or expert.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Add an uncertainty-aware observation scheduler to a neural state-space model or recurrent world model. Between expensive observation-encoder updates, propagate the latent state using the learned dynamics; periodically compute a decimated Riccati prediction and choose the largest skip length whose predicted covariance remains below a task-specific bound. This replaces a fixed observation stride with a principled, state-dynamics-dependent schedule.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace the raw HJB residual loss of a neural PDE solver with a parametrix-preconditioned fixed-point target. At each local space-time patch, analytically propagate terminal values and source terms through a Gaussian kernel whose covariance uses a frozen diffusion matrix, while asking the network to learn only the variable-coefficient correction. This should reduce the burden on the network to represent stiff high-frequency diffusion dynamics and improve short-horizon convergence.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Require Lyapunov decrease not only under the nominal learned transition, but throughout a bounded uncertainty set around that transition. The policy is therefore optimized against identification error and distribution shift rather than trusting a potentially overconfident world model.
Useful7/10
Difficulty6/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
✗ Mechanism failed
2026
Add a numerical-health monitor that distinguishes genuine contraction or chaos from finite-precision periodicization. It tracks hidden-state recurrence, effective cycle length, and the divergence between single-rollout and independent-restart Lyapunov estimates, then triggers precision escalation, rollout truncation, perturbation, or training early stopping when the diagnostic enters the recurrence-collapse regime.
Useful7/10
Difficulty5/10
Novelty8/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
Make a neural network predict a vector potential rather than a magnetic or velocity field, then obtain the physical vector field with a fixed differentiable discrete curl. The reconstructed field satisfies the discrete divergence-free constraint exactly, eliminating divergence-penalty tuning and preventing constraint drift during long rollouts.
Useful7/10
Difficulty4/10
Novelty5/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