△ 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
✗ 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
✗ 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
✗ Failed on benchmark
2026
Use the paper's explicit compact factor of a symplectic state-transition matrix to measure aggregate rotation speed in hidden-state dynamics. Penalize excessive or rapidly varying angular velocity rather than penalizing the full recurrent matrix, preserving nontrivial Hamiltonian rotations while suppressing phase drift that can destabilize long sequences.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Add a bounded probing perturbation to the inputs or intermediate outputs of a neural sensor-fusion model, and choose the perturbation by maximizing separation between the predicted trusted-output set and output sets induced by candidate sensor attacks. Bounded feature and measurement uncertainty are propagated through local neural Jacobians as zonotopes, giving a conservative, geometry-based exposure objective rather than relying on random noise. Training can use the resulting margin as a…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
When a model, dataset, or parameterization has an involutive symmetry, transform gradients and curvature into symmetry sectors before applying adaptive updates. The Hessian and optimizer can then be handled as independent even and odd blocks, preventing curvature from one sector from forcing an unnecessarily conservative learning rate in the other.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural operator from frozen ambient mechanism blocks and a geometry-specific algebraic constraint adapter. The adapter parameterizes all outputs in the affine set satisfying sampled linear constraints exactly, so the network never produces boundary-violating states and does not require a penalty coefficient or post-step projection.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Constrain a student policy to transform its action in the same way that the input state is transformed, while constraining its value estimate to remain unchanged. During distillation, augment every teacher-student pair with several symmetry-transformed copies and penalize disagreement after transforming the student action back to the original frame.
Useful7/10
Difficulty5/10
Novelty4/10
✗ Failed on benchmark
2026
Wrap a neural policy with an online disturbance estimator and a zonotopic reachability shield. Instead of rejecting actions using a permanently worst-case disturbance set, update the disturbance zonotope from observed transition residuals and accept an action only when the resulting reachable set remains inside the safe region.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace uniformly spaced diffusion or energy annealing schedules by a finite sequence of quench-relax stages whose intermediary distributions are approximately equally spaced in Fisher-Rao distance. Each stage abruptly changes the model energy or noise level and then runs a short relaxation phase; the schedule concentrates stages where the distribution changes most sharply. This should reduce nonequilibrium mismatch at a fixed number of sampler evaluations and avoid large distributional jumps…
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Apply the paper's compositional PAS idea to recurrent or state-space networks by propagating a polytope of possible hidden states and input perturbations over multiple time blocks. Instead of validating one hidden trajectory at a time, maintain a trusted convex family and re-linearize only when its nonlinear-fidelity tolerance is exceeded. This creates a runtime monitor and adaptive horizon mechanism for long-sequence inference, forecasting, and learned world models.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a family of nearby neural-network parameter updates by a low-dimensional polytope around the current parameters, and retain only the convex inner region whose predicted nonlinear training dynamics remain close to actual dynamics. Optimize the training objective over this trusted family with a small quadratic program rather than testing many independent candidate steps. The method turns a scalar learning-rate choice into a reusable set of jointly safe update directions.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the auxiliary-spin response of a sequence model as a finite-horizon diagnostic of whether learned event dynamics have become degenerate or insensitive to ordering. Track the minimum polarization gap and the Chern number of the phase-indexed response during training, then regularize or early-stop when a gap closing coincides with a topological-sector change. This supplies a sharp monitor based on a vanishing response norm and an integer transition, rather than relying only on validation loss.
Useful7/10
Difficulty5/10
Novelty9/10
✗ Failed on benchmark
2026
Train a neural controller or learned dynamics model against a finite-horizon set-valued certificate rather than only sampled trajectories. Represent uncertain states and bounded disturbances with hybrid zonotopes, propagate them through affine dynamics and a piecewise-linear neural network, and penalize reachable-set violations and failure to contract into a terminal set. This turns rare worst-case failures into a directly optimized geometric objective.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Replace Euclidean momentum for selected neural parameters with a mirror or Bregman update, while using the paper's accelerated Newton direction for the objective step. Entropy geometry is especially suitable for softmax MoE routers, while Euclidean or log-barrier geometries can be used for unconstrained or positive parameters.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Constrain a recurrent neural transition to map a compact learned-state region strictly into its interior, creating a neural analogue of the paper's maximal attractor. Unlike simple spectral normalization, this permits a nontrivial invariant set and can preserve task-relevant recurrent dynamics while preventing long-horizon state escape.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat the input- or minibatch-dependent Jacobians of a recurrent or state-space network as a random derivative cocycle, and regularize its second Lyapunov exponent away from the first while independently placing the top exponent in a target stable range. This transfers the paper's equivalence between quasi-irreducibility, projective contraction, and a vertical spectral gap into a measurable training objective and a long-horizon stability monitor.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach an SU(2) transport matrix to every directed edge of a graph neural network and penalize nontrivial plaquette holonomies instead of penalizing individual edge transformations. The regularizer is invariant to arbitrary local changes of latent representation frame, encouraging path-consistent relational features without requiring all edges to share one global coordinate system.
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
Replace the Euclidean Polyak step in an optimizer with a mirror-descent step whose length is chosen by projecting onto the current affine lower-bound halfspace in Bregman geometry. This permits entropy geometry for simplex-valued router probabilities, log geometry for positive parameters, and other mirror maps without reducing the method to a norm-based learning-rate rule.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Certify during or after RL training that a neural policy keeps the closed-loop state inside a prescribed safe set under bounded disturbances and observation errors. Use spectral normalization or a Lipschitz penalty to reduce policy gain, then compute a conservative one-step safety margin that must remain positive over reachable states.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a neural controller or latent dynamics model together with a finite abstraction whose cells and successor relations are optimized using a smooth reverse-simulation surrogate. Penalizing concrete-to-abstract mismatch should suppress locally inconsistent or overly expansive latent transitions, while a separate reachability containment check preserves soundness. This creates a verification-aware training signal that targets spurious branching rather than only one-step prediction error.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition by a sequence of exact SU(1,1) hyperbolic updates. The layer processes each token with a 2-complex-dimensional state and preserves the indefinite energy |a|^2-|b|^2=1 exactly, preventing numerical drift while retaining non-unitary amplification and attenuation.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment each recurrent or state-space hidden channel with a two-dimensional oscillatory state and periodically compute a pseudo-phase from its Cartesian coordinates. Use sparse event-triggered feedback to reduce the squared phase order parameter, preventing hidden channels from synchronising while avoiding the computation and communication cost of continuously recomputing the control signal. The controller acts as a tangent rotation of each two-dimensional hidden state, changing phase diversity…
Useful7/10
Difficulty6/10
Novelty8/10