✗ 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
Approximate the minibatch loss Hessian by a positive-semidefinite bulk curvature plus a small signed transverse correction, and treat only the correction with explicit negative-curvature steps. This imports the paper's observation that all unstable directions can be confined to a low-dimensional subspace, producing a curvature-aware optimizer whose step-size boundary is governed by a small matrix rather than the full Hessian.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Train network parameters on a constrained Riemannian manifold using a loss-plus-barrier potential and a two-power normalized gradient flow. The sublinear term rapidly removes optimization errors near the target, while the superlinear term prevents arbitrarily slow convergence from distant initializations; the barrier keeps iterates inside a prescribed feasible region.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Estimate the largest certified input perturbation radius for a neural network using nested reduced primal and dual linear programs rather than solving the complete verification LP immediately. The primal sequence gives certified feasible robustness reserves, while the dual sequence gives valid upper bounds; verification may stop as soon as the interval width is below a prescribed tolerance.
Useful8/10
Difficulty6/10
Novelty6/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
Represent a small neural state-update map or optimizer update by polynomial constraints and certify decrease of a polynomial Lyapunov function on the nonnegative activation or state region using successive Parrilo SOS levels. Use the monotone shift-threshold construction to distinguish genuine instability from failure of a weak certificate, and raise the SOS level only when necessary.
Useful8/10
Difficulty7/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
Replace ordinary empirical-risk minimization on pooled heterogeneous data with worst-case conditional risk over joint distributions that remain close to every source under an optimal-transport budget. The adversary transports source context-label pairs toward high-loss, target-event-like examples, while source-specific radii prevent arbitrary shifts. This should improve performance on rare target contexts and unseen domains without requiring abundant target labels.
Useful8/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Treat stochastic optimization as a perturbed stochastic dynamical system and adapt the magnitude of gradient noise, minibatch error, or parameter perturbations using an estimated Lyapunov decay margin. Perturbations may remain larger far from a solution, but their allowed magnitude is reduced when the local stability margin becomes small, implementing the paper's state-dependent robustness and stochastic input-to-state stability mechanism.
Useful8/10
Difficulty5/10
Novelty7/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
✗ 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 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 failed
2026
Use the robust safety interval width as a training signal and activate conservative control before the neural policy reaches an infeasible state. The network is trained to preserve a positive reserve between competing constraints, reducing abrupt projection corrections and making the closed loop less sensitive to model and disturbance errors.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace Euclidean projected gradient descent with a state-dependent SPD preconditioner whose inverse defines the projection metric. Spectrally clip the preconditioner and limit its step-to-step variation, using the paper's convergence conditions to prevent adaptive-metric oscillations while retaining useful curvature scaling.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Use a two-stage residual augmentation loop: first let a residual network explain model mismatch, then project its learned vector field onto a physically constrained candidate library and replace the flexible residual with the accepted sparse terms. This turns an unconstrained neural correction into a low-complexity dynamical law that is easier to roll out over long horizons and can expose unsupported hidden-state explanations.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the shared hidden trunk of a multi-output regression network with a small bank of differentiable symbolic units, then let every output use a sparse additive or multiplicative combination of the same units. The architecture explicitly tests whether outputs share a latent mechanism instead of merely sharing arbitrary neural features, improving identifiability and producing equations that can be inspected or exported.
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
✗ Mechanism failed
2026
Train a neural policy against the same dynamically reconstructed barrier used during inference. Penalize barrier violations using the current observer uncertainty margin, causing the policy to avoid states where safety would require large corrective projections.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace an expensive proximal activation or implicit optimization layer with a Gaussian barycentric estimator computed from energy evaluations. The resulting map is smooth and has a provable cocoercivity guarantee when the energy is weakly convex, making it a stable alternative to unconstrained learned activations or iterative proximal solvers.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the standard K-1 separate targeted robustness optimizations for a sample with one shared optimization whose scalar objective is the smallest correct-versus-target logit margin over every incorrect class. The same hidden-state relaxation and lifted SDP variables are shared across classes; only K-1 linear margin constraints remain. This should substantially reduce wall-clock time when K is large, while preserving the exact logical meaning of a full robustness certificate.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Train a two-dimensional neural deformation map with the paper's Lp conformal-distortion energy instead of using only a determinant or smoothness penalty. The resulting barrier penalizes near-folds and directional collapse while permitting useful nonrigid deformation, making it suitable for spatial transformers, image registration, and learned coordinate warps.
Useful7/10
Difficulty4/10
Novelty6/10