△ Mechanism confirmed, baseline not beaten
2026
Compute an inner approximation of the states from which a neural controller can keep the plant inside a prescribed safe domain indefinitely, then use the resulting regulation map as a safety shield around the network. At each state, the network proposes an action, but the shield projects or replaces it with an action certified to remain in the invariant set.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Constrain the Jacobian of a complex-valued neural ODE or recurrent state update so that it is contracting in a state-dependent Hermitian metric. The resulting model should forget perturbations and initialization differences exponentially, improving long-horizon rollout stability while retaining coordinate-invariant stability information.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace fixed random source-target pairings in flow matching by an outer loop that repeatedly solves exact OT assignments inside minibatches, trains the velocity field on the resulting pairings, and regenerates pairings from the learned flow. The mathematical guarantee is not global OT optimality: for batch size N, any limiting coupling is N-cyclically monotone and the squared endpoint cost cannot increase through the alternating updates. This should produce straighter trajectories and permit…
Useful8/10
Difficulty5/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Represent each neural module as a Hamiltonian storage system and connect modules through a state-dependent skew or Dirac interconnection instead of arbitrary residual additions. The coupling may change with the hidden state, but its internal power contribution cancels exactly, so total stored energy is controlled only by external inputs and explicitly added dissipation.
Useful8/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the black-box equilibrium denoiser in an image-restoration DEQ with a positivity-preserving mirror-descent equilibrium driven by the exact Gamma likelihood and a discretized surface-area/mean-curvature regularizer. The equilibrium layer has a small number of learned scalar or channel-wise parameters instead of a large implicit CNN, while the exponentiated update prevents negative intensities and naturally matches multiplicative noise.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Represent a neural controller as the projection of a learned Hamiltonian stable manifold rather than learning a state-to-action map without geometric constraints. Train a manifold chart together with its invariance equation, and reject or branch-switch near points where the manifold projection becomes singular. The resulting controller exposes a measurable boundary between single-valued smooth feedback and multivalued or hysteretic feedback.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach several neural vector fields to a latent representation and train them to form a closed Lie algebra rather than learning unrelated augmentation directions. The resulting generators provide data-driven continuous transformations that can be used as equivariance constraints, while bracket closure and basis-rank penalties prevent degenerate or redundant generators.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed DCT or Fourier transform in transform coding with a trainable isometric tensor-network transform whose local gates are learned once on a dataset. Retain the k coefficients with largest magnitude and reconstruct with the exact adjoint transform; the transform remains norm-preserving and fast while adapting its coefficient ordering to the data distribution.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Modify the flow-matching denoising velocity at every integration step by the smallest Euclidean correction that satisfies a control-barrier inequality on the entire generated action chunk. Aggregate waypoint and constraint barriers with a smooth minimum, so the sampler remains differentiable and can enforce safety without retraining the action model or applying a discontinuous final-action projection.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Attach a quadratic-program safety filter to a neural policy that outputs a desired reference rather than directly replacing the underlying stabilizing controller. The filter uses a model of the complete closed-loop dynamics to make the smallest reference modification satisfying a control-barrier inequality, allowing aggressive neural behavior while preventing violations of state constraints.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Constrain the Jacobian of a neural ODE or recurrent transition so that its second additive compound is Metzler and irreducible, then regularize the resulting finite-window wedge transition toward strict positivity. This should contract projective distances between admissible tangent 2-planes, causing perturbation planes to align and making long-horizon representations effectively two-dimensional rather than allowing uncontrolled orientation growth.
Useful8/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained deep RoPE attention residual update by a spherical or norm-preserving update whose attention kernel has a known positive floor. Estimate the reversible transverse spectrum of the current attention matrix and choose the residual step size below its explicit Euler stability limit; use the angular token diameter as a runtime contraction monitor.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained neural decision head followed by clipping, projection, or penalty losses with a Legendre-regularized optimizer layer that always returns a feasible decision. The layer maps network-produced latent scores smoothly into the relative interior of a convex feasible region and can be differentiated using the inverse Hessian of the regularizer.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition by a unidirectional cooperative state-space update whose tangent dynamics preserve a positive cone. Add a penalty enforcing strict cone preservation and a spectral gap between the dominant ordered direction and transverse directions, so long sequences collapse toward a stable one-dimensional ordered manifold without eliminating nonlinear expressivity.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Equip a learned dynamics model with an adaptive parameter estimate and an explicit component-wise uncertainty box. Require a nominal backup-policy rollout to remain inside a safety margin equal to the rollout's worst-case parameter sensitivity, producing a conservative filter for reinforcement learning and world-model planning that becomes less conservative as the model identifies its parameters.
Useful8/10
Difficulty6/10
Novelty7/10
△ 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
✗ Failed on benchmark
2026
Replace the usual random or elementwise-positive linear-attention feature map with a rank-one positive-semidefinite feature map derived from query and key vectors. For normalized inputs, the resulting kernel is the squared inner product, which is nonnegative and gives a geometrically structured interference pattern that is better suited to associative recall than an arbitrary low-rank feature map.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent every nonnegative equal-mass one-dimensional state by its CDT quantile map relative to a fixed reference density, then train the neural dynamics model in this transformed space rather than on Eulerian grid values. The latent manifold for translations and transport-dominated evolution is substantially flatter: linear transport lies in the span of the initial transformed state and the constant function, while nonlinear conservative dynamics have algebraic approximation error bounds.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a dense directed attention matrix by a collection of K learned source-to-hub-to-target interactions. Each hub corresponds to a directed biclique, allowing many source tokens to communicate with many target tokens using O(NK) rather than O(N^2) pair interactions. The construction preserves asymmetric information flow and can be initialized from a graph cover of high-attention edges.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace Euclidean or entrywise Kronecker fitting of a layer curvature matrix with its affine-invariant projection onto G = A tensor B. Use the resulting factors as a compact SPD preconditioner in the optimizer, while solving the projection through logarithmic residual partial traces and Armijo line search.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace the transition function of a latent world model, recurrent state-space model, or neural ODE with a learned Hamiltonian flow. The network predicts a scalar latent Hamiltonian, while a symplectic integrator generates future states, preserving canonical phase-space structure and suppressing artificial long-horizon energy drift.
Useful8/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a one-dimensional sharp-feature signal by a small unordered set of complex singularities and residues instead of predicting all grid amplitudes. A transformer diffusion model predicts these tokens, and a differentiable meromorphic decoder evaluates the result directly at arbitrary coordinates, avoiding grid-specific interpolation and preserving discontinuity structure.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace unconstrained residual updates with blocks whose Jacobian is monitored through a Davis–Wielandt shell. The shell simultaneously measures directional dissipation and non-normal amplification, yielding a per-block step-size or residual-scale bound that is stronger than checking only the largest eigenvalue or spectral norm.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace token-by-token KV storage after an SSM or recurrent encoder with an online allocate-on-novelty cache. A new slot is created only when the incoming key is sufficiently dissimilar from every stored key; otherwise the incoming value is merged into its nearest slot, so repeated or redundant content does not grow the cache.
Useful8/10
Difficulty4/10
Novelty6/10