✗ Mechanism failed
2026
Replace the standard Gaussian perturbation kernel in a diffusion model for nonnegative or half-space data with the exact Dirichlet heat kernel obtained by subtracting the reflected Gaussian. Train the score network against the analytic boundary-corrected score, preserving absorbing-boundary behavior without clipping, reflection heuristics, or an unconstrained coordinate transform.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Wrap a stochastic neural predictor with a robust multimodal aggregation procedure: sample the predictor at perturbed inputs, cluster the resulting outputs, trim an alpha-fraction of outliers separately inside every cluster, and return a weighted mixture rather than one global average. This should preserve distinct plausible modes while suppressing adversarial or heavy-tailed samples that would otherwise distort the prediction.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural operator around explicit input and output measurement spaces rather than forcing the network to consume and emit a fixed grid. The same learned latent surrogate can be reused on alternative sensor layouts or query meshes through reconstruction and re-encoding maps, with a consistency loss enforcing agreement between measurement pipelines.
Useful7/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained learned dynamics model in model-based reinforcement learning or neural optimal control with a Koopman-style observable lift and an explicitly estimated infinitesimal generator. Train a value network against an HJB residual formed from this generator, so the critic is constrained by the observed vector field and control directions rather than relying only on temporal-difference targets.
Useful7/10
Difficulty5/10
Novelty6/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 failed
2026
Evaluate weak residuals against a bank of periodic trigonometric test functions using FFT projections instead of repeated pointwise quadrature or output automatic differentiation. Frequency truncation and mode weighting provide a direct way to control the spatial scales enforced during neural PDE training.
Useful7/10
Difficulty4/10
Novelty6/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
✗ Failed on benchmark
2026
Attach an adaptive conformal error radius to every predicted agent and forecast horizon, then use that radius to inflate collision constraints or mask unsafe actions in a learned policy. Unlike a fixed heuristic margin, the radius automatically grows after systematic prediction failures and shrinks when the predictor is accurate, providing an explicit accuracy-versus-conservatism control.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Expose a recurrent model to deliberately designed input pulses or latent-state perturbations instead of training only on passive trajectories. Choose perturbations that maximize the smallest eigenvalue of the accumulated feature Gramian, making otherwise indistinguishable recurrent couplings recoverable and reducing uncertainty in long-horizon predictions.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Initialize latent coordinate-frame parameters analytically from two temporally separated neural predictions instead of starting joint optimization from arbitrary translation and orientation. This removes the continuous gauge before backpropagation and should prevent EKF-like or gradient-based failures caused by large yaw and position initialization errors.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Mechanism failed
2026
Train a small encoder and latent Koopman predictor to forecast whether a neural sequence model will enter a high-error or high-instability region, then execute an expensive refinement block only when the forecasted risk exceeds a threshold. The base model remains active at every step, so the learned preview model controls computation rather than directly replacing the main predictor. Add a bounded-rate interpolation when the gate switches off, preventing abrupt changes in recurrent state or…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Combine a learned dynamics model or neural policy with a short-horizon robust MPC wrapper. Instead of tightening every future constraint by one stationary worst-case radius, propagate uncertainty using the actual neural closed-loop Jacobians and explicitly fall back when the tightened optimization problem is infeasible, making envelope violations observable rather than silently unsafe.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace the naive pseudospectral evaluation of a quadratic neural-operator nonlinearity with a two-point split-form product. Use the entropy-stable (alpha, beta) = (1/3, 2/3) split as the default, or learn alpha under the consistency constraint alpha + beta = 1 while monitoring energy growth. The goal is to suppress weakly underresolved aliasing and prevent long-horizon rollout blow-up without full 2/3-rule zero-padding.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Parameterize a continuous normalizing flow by a scalar potential and convert its gradient into the generalized p-optimal velocity field rather than using the usual quadratic-flow velocity. Train the field by matching velocities along straight source-target bridges, while retaining a terminal distribution loss so the flow remains useful when exact pointwise pairings are unavailable.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train a neural controller or sequence model with STL robustness margins for temporal requirements such as staying above an active-power floor, maintaining connection during a disturbance, and recovering before a deadline. Use the robustness margin as a constrained objective and retain a non-differentiable STL monitor for certification, so the network is optimized toward a quantitatively specified feasible region rather than merely rewarded for average trajectory performance.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a certificate to a cached transformer KV state or recurrent latent state and refresh it only while its predicted certificate remains inside a latency-contracted admissible region. The controller uses a bound on certificate drift to guarantee that the state will remain admissible throughout the next sampling, communication, and execution delay, reducing unnecessary recomputation while exposing a measurable refresh boundary.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Attach a finite-sample conformal error radius to a neural surrogate of a dynamical or sequence model, and propagate that radius through the model's local sensitivity. The model should expose a calibrated prediction set or abstain whenever the accumulated bound exceeds a task-specific tolerance, making long-horizon failure a measurable coverage event rather than an unobserved drift.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Train an augmented latent neural ODE from snapshot observations of only the visible coordinates by transporting particles from an initial latent distribution and differentiating their visible locations through forward sensitivity equations. Replace density-PDE discretization or potentially biased same-particle density objectives with a kernel marginal-matching loss whose gradient is estimated using independent particle sets.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Add a trajectory-complexity monitor and regularizer to an RNN, SSM, or world model that limits the number of distinct hidden-state symbol patterns produced over selected time subsets. The paper's nullness criterion suggests targeting polynomial maximal pattern growth rather than merely minimizing one-step Jacobian norms, thereby suppressing combinatorial explosion of long-horizon behaviors while retaining nontrivial dynamics.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a kernel aggregation layer whose output is a tangent vector field on the unit sphere and whose surface divergence is identically zero by construction. For each source point, use a matrix kernel obtained by applying a surface-rotated gradient in the query variable to a scalar zonal kernel; this is a differential-form version of the paper's matrix-valued construction. The layer can replace attention or message passing when the target dynamics are incompressible, such as spherical fluid…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach an online uncertainty estimator to the perception or dynamics model and inflate every obstacle constraint by a confidence radius before applying the control-barrier-function filter. The actor still proposes the nominal action, but the executed action is the closest admissible action satisfying the uncertainty-adjusted barrier inequality, producing a tunable safety-versus-intervention mechanism.
Useful7/10
Difficulty5/10
Novelty7/10