△ 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
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed optimizer preconditioner with a diagonal matrix selected by an online convex optimizer. A gradient predictor supplies the direction, while a linear-loss regret update learns coordinate-wise gains that favor transformations aligned with the realized stochastic gradient. The method retains the identity preconditioner as an explicit comparator, so it can be tested for negative regret and improvement over ordinary SGD.
Useful8/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Insert an online errors-in-variables subspace estimator into a latent state-space neural network. A fixed recent window of encoder features and controls is used to estimate a noise-corrected low-dimensional state subspace and refit the latent transition and readout matrices, allowing the model to follow sensor degradation or changing operating conditions without replaying the entire dataset.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Model a multi-timescale optimizer as a controlled dynamical system and use several Lyapunov-like quantities to regulate loss, momentum energy, and constraint violation simultaneously. The explicit high-order control-Lyapunov feedback becomes a low-cost correction to an SGD-momentum or Adam step. A Hurwitz comparison matrix supplies a measurable stability certificate and predicts the decay rate of the controlled training dynamics.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Replace an unconstrained recurrent update or neural-ODE vector field with a nominal learned control plus an explicit high-order barrier correction. The correction enforces hidden-state safety even when the control affects the safety variable only after several time derivatives. A quadratic-program projection preserves the nominal network output whenever the learned dynamics already satisfy the barrier inequality.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Treat neural modules as interconnected dynamical subsystems and estimate the gain from every module input to every neighboring module output. Replace an expensive global Jacobian spectral-radius calculation by decentralized directed-cycle tests inside clusters and path-gain tests between clusters. Penalizing violations during training should prevent exploding recurrent trajectories while retaining less conservative behavior than constraining every individual block independently.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace pointwise high-order PINN residuals with a stochastic one-step residual evaluated on Brownian transitions. A single scalar network produces the value, gradient, and Hessian by automatic differentiation, and the quadratic centered increment supplies a stochastic probe of the Hessian. Add a terminal gradient penalty so the learned full jet is constrained at the terminal boundary, not only the scalar value.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace uniform graph-convolution aggregation with a distance-aware message transform whose strength decays as \(\gamma^k\). At hop \(k\), transform the learned local evidence with \(2\operatorname{artanh}(\gamma^k z)\) before summation, so distant nodes have a provably shrinking influence window rather than accumulating unbounded noisy evidence.
Useful8/10
Difficulty5/10
Novelty6/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
✗ Failed on benchmark
2026
Replace an EKF or a large particle ensemble inside a neural world model with a fixed-order polynomial chaos representation of the latent state distribution. The transition network is evaluated under quadrature or sampled chaos variables, and Galerkin projection produces the next uncertainty coefficients directly; a coefficient-wise LMMSE update then assimilates observations without backpropagating through resampling.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a neural policy with a control-barrier safety layer whose constraints use an online estimate of model mismatch or environmental disturbance. Instead of enforcing a fixed worst-case bound at every state, the layer reconstructs the current effective dynamics from an extended state observer and adds only the margin required by the remaining estimation error.
Useful8/10
Difficulty6/10
Novelty6/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 the uniform or power-law convolution in a recurrent or state-space layer by a Gaussian q-binomial fractional kernel with learnable order alpha and deformation q. The parameter q controls a concrete memory-localization transition: q close to 1 gives classical fractional power-law memory, whereas q<1 produces exponentially localized memory and should reduce long-horizon gradient interference and truncation cost.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Train a primal state network and a dual flux network jointly, using the convex primal-dual gap as the main loss and as an a posteriori certificate of state error. Unlike a strong residual, the certificate is based on monotonicity and convex duality, so it can remain informative even when differentiating rapidly oscillatory coefficients would amplify noise by $1/\varepsilon$.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a single neural representation of a rapidly oscillatory PDE solution by a macroscopic network plus an explicitly oscillatory corrector network. Feed the network both the slow coordinate $x$ and fast coordinate $y=x/\varepsilon$, and train the resulting composite field in a variational energy objective. This targets the paper's scale-robust approximation bound rather than forcing the optimizer and finite sample set to discover oscillations of wavelength $\varepsilon$.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use the learned path only as a global proposal, then correct complete trajectories rather than endpoints. Exponentiated negative work gives self-normalized importance weights, while the same path ratio gives an independent Metropolis acceptance probability. This turns an imperfect neural sampler into an asymptotically exact sampler whenever forward and reverse path laws overlap.
Useful8/10
Difficulty4/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
✗ Mechanism failed
2026
Replace direct learning of a highly cancelling signed observable with a quotient-space model over symmetry orbits of inputs. Predict a physically constrained baseline for each family and use an LSTM or set/graph encoder only for the residual many-body correlation, then aggregate family predictions with known signed weights instead of forming a noisy sample-level ratio.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Wrap policy training or deployment with a distribution-level statistical verifier that tests whether a candidate neural policy violates either a performance threshold or any safety constraint with probability at most \(\varepsilon\). The verifier returns a policy only after obtaining a high-confidence upper bound on the violation rate, making safety a measurable acceptance criterion rather than an average reward penalty.
Useful8/10
Difficulty5/10
Novelty6/10