△ Mechanism confirmed, baseline not beaten
2026
Add a reachability loss that forces annotated structural endpoints or landmarks to remain connected through high-confidence pixels. Instead of averaging error over all pixels, the loss penalizes the weakest pixel on the best available path, directly targeting bottlenecks responsible for broken vessels, roads, and cracks.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or state-space update with a block whose state Jacobian is contractive and whose input Jacobian has a controlled gain. This should make hidden-state discrepancies caused by initialization, quantization, or input noise decay geometrically rather than explode, while retaining a finite and predictable response to persistent input perturbations.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace ordinary global gradient clipping with clipping of each stochastic gradient around a robust minibatch center rather than around zero. This preserves the common directional component of the gradients and suppresses only heavy-tailed residuals, making the update usable when gradient noise has a finite α-moment for 1 < α ≤ 2 but no finite variance.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace ordinary token merging or graph pooling with a learned block map whose output preserves information about a remote target conditioned on the surrounding coarse representation. The paper's majority-spin counterexample gives a concrete failure mode: two microscopic configurations mapped to the same pooled token can imply different predictions for distant variables.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace fixed Gaussian noise in a private optimizer with generalized-Gaussian noise whose shape p is selected for the actual clipped-gradient sensitivity and privacy budget. For every candidate p, numerically find the minimum scale b satisfying the hockey-stick privacy constraint, then choose the p minimizing a gradient-update utility moment such as variance or expected absolute magnitude.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or state-space network as a locally linear dynamical system and select a small set of hidden-state or module coordinates that have unusually high leverage on a target output through a dominant unstable or weakly damped eigenmode. Use the ranking both for red-team targeted perturbations and for defense: penalize, prune, or damp selected coordinates so that target amplification is reduced without uniformly shrinking all recurrent dynamics.
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
✗ Failed on benchmark
2026
Partition neural-network parameters into blocks and update each block using a stochastic proximal best response, followed by Krasnoselskii relaxation. The relaxation factor and minibatch size become explicit stability knobs: aggressive stochastic updates are damped, while larger batches are used when the estimated update variance approaches the mean-square stability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Train separate neural value functions for primitive reachability, avoidance, or target-reaching tasks, then combine them with a coordinatewise monotone aggregator whose derivatives with respect to all primitive values are nonnegative. This transfers the paper's exact two-player decomposition condition into a modular critic architecture: adding a new target changes only one primitive critic and the aggregator, rather than requiring a new high-dimensional value function.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Constrain a set of learnable or batch-produced unit-norm embeddings by matching their spherical-harmonic power spectrum to a target spectrum rather than relying only on pairwise Euclidean repulsion. This creates an explicit, tunable mechanism for suppressing low-frequency density fluctuations or enhancing a selected angular frequency, which can improve uniformity and reduce representation collapse on hyperspherical embeddings.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a curvature-margin regularizer to a neural latent-state estimator or world model so that every initial-state direction is sufficiently constrained by the observation history and prior. The regularizer targets the smallest posterior-curvature eigenvalue, not total information, making the estimator resistant to systematic transition-model mismatch in poorly observed latent directions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Attach a Gaussian condition discriminator to an intermediate neural representation and train it adversarially against the fault classifier. The discriminator predicts both the mean and uncertainty of a continuous operating condition, forcing the encoder to remove condition-dependent variation without treating the condition as a small set of artificial domains.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a neural-network penalty loss for differentiable equality constraints with a primal-dual update that solves one positive-definite linear system per step and then updates multipliers using the actual nonlinear constraint residual. Keep the penalty coefficient fixed instead of increasing it during training, reducing the usual penalty-conditioning tradeoff while directly controlling constraint violation.
Useful7/10
Difficulty6/10
Novelty6/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
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 latent world model with a conditional-mutual-information lower-bound constraint instead of using a fixed curiosity or information-gain coefficient. The dual multiplier increases only when predicted observations contain less information about latent states and model parameters than the goal prior demands, and decreases when the target is exceeded; this produces an adaptive epistemic-pressure schedule with explicit inactive and saturated regimes.
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
Replace the raw gradient step for a neural-network parameter block with a proximal quasi-Newton step, using the proximal operator to enforce nonsmooth constraints or structured regularization and an adaptive linesearch that enlarges the stepsize after several successful iterations. The method should permit much larger steps than conservative monotone backtracking while retaining a residual-decrease safeguard near unstable regions.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use the estimated task relevance of each latent coordinate to allocate corruption, precision, or redundancy non-uniformly rather than applying uniform dropout or quantization noise. Coordinates with larger mutual-information sensitivity receive lower noise or more bits, while low-relevance coordinates are compressed or corrupted more aggressively.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a conventional whitening transform with a constrained whitening layer that minimizes cross-channel covariance while requiring every output channel to remain correlated with its designated input channel by at least a threshold \(\rho_{\min}\). The layer exploits the orthogonal freedom in whitening to find a rotation that preserves channel identity instead of arbitrarily mixing features. It can be inserted before an MLP, convolution, or attention projection and compared directly against…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Make directed edge weights trainable while constraining optimization to remain away from eigenvalue collisions of the graph Laplacian. The network can learn task-specific interaction strengths while preserving a measurable diagonalizability margin and avoiding ill-conditioned modal dynamics.
Useful7/10
Difficulty7/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
✗ Failed on benchmark
2026
Use the learned variational functional's second functional derivative as a consistency mechanism: equilibrium susceptibility, forces, and phase stability must all be computed from the same Hessian rather than from independently trained predictors. Penalize negative or excessively ill-conditioned Hessian modes during training, while retaining soft negative modes as a detectable phase-transition signal.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use trajectory sensitivities to remove neural units or parameter groups whose effects are redundant over the available data support. A parameter group is pruned when its Fisher contribution is small or its sensitivity is nearly collinear with other groups, producing a compact neural ODE without relying only on parameter magnitude.
Useful7/10
Difficulty5/10
Novelty8/10