△ Mechanism confirmed, baseline not beaten
2026
Modify an evolutionary-strategy gradient estimator so that the observed phenotype or trajectory is used to infer the conditional mean of the latent ES perturbation. Instead of multiplying fitness by the raw perturbation, multiply it by the posterior mean perturbation given the realized input; this remains unbiased and has variance no greater than the ordinary ES estimator when the conditional model is correct.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Use a finite-state Markov router to select recurrent or expert Jacobians, and regularize or optimize the router through the top Lyapunov exponent computed from state-conditioned projective statistics. The paper's mechanism predicts that this exponent varies smoothly with routing probabilities when the transition matrix is primitive and the dominant exponent is simple, while loss of primitivity, resonance, or exponent collision marks a detectable boundary where routing gradients may become…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Train a sequence model so that measured perturbation responses and spontaneous hidden-state correlations satisfy the paper's off-diagonal fluctuation–response identity. This discourages arbitrary non-reciprocal dynamics while preserving a controlled antisymmetric response that can encode directional temporal dependencies.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Train an admission or MoE routing gate not only to reduce its immediate workload, but also to preserve the ordering between a controlled trajectory and a baseline trajectory under the same request stream. Penalize counterfactual events in which the controlled system, after initially rejecting work, later exceeds the baseline workload because its changed state causes a large job to be admitted.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the unresolved small jumps of an infinite-activity stable Levy noise source in a neural SDE or stochastic optimizer with one Gaussian increment whose variance equals the discarded jump variance. Simulate only jumps above the cutoff exactly or by Poisson sampling, retaining the large-jump distribution while obtaining the paper's O(\varepsilon) Wasserstein error instead of the naive O(\varepsilon^{1-\alpha/2}) error.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use a Gaussian-mixture latent prior whose component weights, means, and covariances admit no nontrivial affine automorphism. Add a differentiable penalty that separates component signatures, reducing permutation, reflection, and other affine ambiguities in unsupervised latent representations.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace Gaussian covariance propagation in a neural state-space model with a finite Perron–Frobenius operator acting on coefficients of a learned density basis. A neural encoder maps observations to latent states, while an eDMD-derived matrix transports the full coefficient vector and supports multimodal or skewed uncertainty. This creates a cheap deterministic uncertainty layer that can be rolled forward for long horizons without repeatedly sampling particles.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Augment the ordinary gradient of a neural-network loss with the chain-rule term caused by the model changing the future data distribution. Estimate the unknown distribution-response Jacobian using paired rollouts at randomly perturbed parameters, averaged over a sphere-direction minibatch; this makes the method applicable when the environment is a black box and only samples from the induced distribution are observable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a probabilistic reachable-set head to a neural world model so that long-horizon predictions produce both a mean trajectory and an uncertainty envelope. Train or calibrate the model using the probability that the predicted envelope intersects an unsafe region, allowing early-warning losses to penalize risk before an actual violation appears. The transferable signature is a predictable monotone increase in warning probability as the reachable set approaches or intersects a forbidden set.
Useful7/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace the final nonlinear transition network of a latent world model with a linear Koopman-style transition whose coefficients have a Matrix Normal-Inverse Wishart prior. Meta-learn the prior across tasks, then adapt only closed-form sufficient statistics from a few recent transitions; this should be more data-efficient and uncertainty-aware than gradient fine-tuning under distribution shift.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a conventional minibatch gradient computed from consecutive correlated samples with a coupled multilevel estimator whose fine-minus-coarse differences are evaluated on the same trajectory segment. Clip each correction and the final estimator to a certified or empirically estimated norm bound. The estimator should be most useful in streaming reinforcement learning and time-series training, where independent minibatches cannot be obtained cheaply.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary graph convolution with a Markov diffusion whose edge transition probability is proportional to a geometric distance weight d(v,u)^(n−2), following the paper's Delaunay discretization theorem. Use graph Dirichlet capacity on expanding node shells to detect whether information escapes through the graph or repeatedly returns to local neighborhoods, and use this signal to select propagation depth or add a regularizer.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace unconstrained input perturbations or generic distribution shifts with a conditional adversarial generator whose samples remain on a prescribed generator manifold. For each context x, maximize downstream loss over generator parameters within a debiased Sinkhorn-divergence radius of the nominal conditional generator, then minimize predictor loss against the resulting worst-case samples.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a soft auxiliary load-balancing loss with a deterministic router correction that balances expert assignments separately within confidence or score shells. The correction preserves the number of tokens assigned to each shell while making every expert receive equal or nearly equal mass inside each shell, preventing high-confidence tokens from monopolizing a subset of experts.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace a single optimizer trajectory by N parameter particles and optimize the time until the first particle reaches a target loss or reward threshold. Use distinct interaction regimes: bounded normalized interactions should provide only the usual logarithmic extreme-search improvement, whereas unnormalized coherent force accumulation and stochastic pairwise kicks should produce distinct 1/N and 1/(N ln N) first-hit laws.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the recent history of generator outputs as a controllable training window instead of fixing the replay-memory depth globally. Estimate how quickly each fitness level improves as more same-level examples enter the window, and increase memory only when the measured escape probability improves enough to justify the extra stale data.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace backpropagation through a small encoder with an online local update driven by consecutive examples and a fixed random projection of hidden activity. The projection produces a modulatory signal that encourages temporally adjacent inputs to have compatible representations, while the homeostatic term prevents sigmoid units from saturating or collapsing.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Use neural networks to estimate outcome and treatment nuisances, then edit the resulting debiasing weights so that residualized treatment is conditionally orthogonal to an adversarial class of covariate functions. This should reduce coefficient bias when the two nuisance networks have strongly imbalanced approximation errors, without requiring either network to be correctly specified.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach uncertainty to neural value targets by estimating the empirical one-step Bellman perturbation and propagating it through the discounted closed-loop transition operator. Use the resulting uncertainty to downweight high-variance Bellman targets or regularize the critic toward conservative predictions, especially in offline or model-based reinforcement learning.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use several independently percolated versions of an input graph and rank nodes by Jordan centrality inside the largest retained components. Feed only the consistently high-ranked nodes to a graph readout or source-localization head, making predictions depend on structurally stable regions rather than shortcut edges or fragile local neighborhoods.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train a neural policy against a simulator using an adaptive constraint set formed from the worst violations, rather than uniformly averaging all rollouts. At each round, identify the trajectory with the largest normalized safety violation, add its state-time features and violation margin to a surrogate barrier or penalty model, and fine-tune the policy until the surrogate constraints are satisfied. This should reduce the gap between nominal validation risk and rare-event failure risk while…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace purely Gaussian optimizer noise with symmetric alpha-stable jumps and add a restoring drift toward an exponential-moving-average parameter anchor. The drift prevents persistent parameter diffusion, while heavy-tailed jumps provide rare, large excursions that can cross sharp basin barriers and remain effective when gradient-noise variance is undefined.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the usual parameter-plus-momentum Langevin state with a three-level chain consisting of parameters, velocity, and acceleration, while injecting Gaussian noise only into the highest auxiliary state. At a saddle, the escaping direction has a positive rate given by a cubic characteristic equation; use this rate to choose damping or adapt the temperature so that basin escape is accelerated without making the dynamics unstable.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an orthogonal truncated Fourier or Wigner projection in a compact-Lie-group equivariant layer by a finite-rank Fejér-Markov filter. The filter acts as a normalized positive group convolution, preventing sup-norm amplification and suppressing high-frequency artifacts while retaining exact equivariance.
Useful7/10
Difficulty6/10
Novelty7/10