△ Mechanism confirmed, baseline not beaten
2026
Replace raw control-barrier-function value penalties with an invariance-authority demand computed from boundary geometry and available control authority. For a learned or known control-affine neural dynamical system, penalize states where the uncontrolled vector field points outward more strongly than the actuator can push inward. The resulting quantity is invariant to positive rescaling of the barrier representation and directly predicts the actuator-strength threshold at which controlled…
Useful8/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Train an encoder-decoder world model together with a latent transition map, but certify latent attractors only when the learned model is approximately semiconjugate to the observed high-dimensional dynamics with residual below the isolating-set margin. Compute a Conley-Morse graph on a latent grid and lift each certified recurrent component through the decoder to obtain a region in the original state space where an attractor or invariant set is predicted to exist.
Useful8/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained neural ODE vector field with a learned port-Hamiltonian vector field whose energy gradient drives the dynamics, whose interconnection matrix is skew-symmetric, and whose dissipation matrix is positive semidefinite. The resulting model remains expressive through state-dependent neural matrices while guaranteeing non-increasing learned energy in the unforced case.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Add a geometric barrier loss to a neural trajectory generator or scorer using separating-axis margins between ego and predicted-agent oriented bounding boxes. The barrier is differentiable almost everywhere and has direct collision meaning, unlike an arbitrary proximity penalty.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Augment an RNN or state-space model with a three-dimensional auxiliary spin updated by noncommuting rotations associated with event types or token classes. The ordered product preserves information that additive counters discard: two sequences with the same number of each event can produce different final spins when their event order differs. Train the spin axes, angles, and readout jointly with the task model while constraining every update to remain on the sphere.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Distill the expensive inner minimization over state-estimation errors into a neural correction term that predicts the robust barrier drift, then fine-tune the correction using differentiable closed-loop rollouts. This retains the robustness mechanism while reducing the repeated optimization cost and allowing less conservative behavior than fixed analytic uncertainty bounds.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
At a learned switching hyperplane, replace ambiguous hard routing by a convexified vector field whose normal component is zero whenever neighboring vector fields point toward the surface. This gives a non-chattering approximation of Filippov sliding and can improve long-horizon integration near friction thresholds, impacts, and climate regime boundaries.
Useful8/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a differentiable temporal barrier layer to a neural multi-agent policy or learned controller. The layer estimates the minimum collision time under admissible adversarial actions and minimally modifies the policy action whenever this time falls below a safety margin, allowing close approaches that are dynamically safe instead of enforcing a conservative fixed distance.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Wrap a neural policy with a small quadratic program that minimally modifies its acceleration or thrust command whenever predicted pairwise separation approaches a safety boundary. Use a learned residual model to estimate uncertainty and inflate the barrier constraint by a high-probability disturbance bound, giving a falsifiable safety-versus-control-authority tradeoff instead of relying on unconstrained policy behavior.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Represent a scalar energy or free-energy functional of a three-dimensional neural field using translation- and rotation-equivariant convolutions, and produce the field prediction by minimizing the total functional rather than by a direct decoder. The same functional can then generate equilibrium states, forces, and response observables under new external fields, resolutions, and system sizes.
Useful8/10
Difficulty7/10
Novelty6/10
✗ Failed on benchmark
2026
Train a neural policy through a differentiable dynamics model while enforcing a Control Barrier Function condition at every rollout state, rather than applying a penalty only to observed constraint violations. The barrier residual becomes a local certificate that the learned policy points inward at the boundary of the safe set, allowing safety to be checked on unseen states when combined with a margin and Lipschitz bound.
Useful8/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Add an explicit unknown-frame variable to a recurrent world model or multimodal sensor-fusion network, and train it only on temporal windows whose latent motion provides enough excitation to identify that frame. The model should use a two-view or multi-view consistency loss and an adaptive gate based on the smallest singular value of the window Jacobian, preventing optimization from confidently fitting geometrically ambiguous trajectories.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Constrain the first convolutional layer, or every convolutional layer, by averaging each kernel over the 48 rotations and reflections of the cubic point group. A scalar 3D field then receives exactly the same prediction after any lattice rotation or reflection, eliminating the need to learn equivalent crystallographic orientations from separate examples.
Useful8/10
Difficulty4/10
Novelty5/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
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
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
△ 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 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
Augment a flow-matching or diffusion sampler with a dual variable for each equality constraint and integrate the sample and dual variables as one coupled ODE. The learned generative velocity is corrected in the constraint-normal direction using the transpose Jacobian of the constraint, while the dual state accumulates residual violations; this replaces per-step projection or nonlinear optimization.
Useful8/10
Difficulty5/10
Novelty7/10
✓ Mechanism works
2026
Replace a pixelwise density decoder with a decoder that predicts coefficients of a transport potential relative to a fixed reference density. The reconstructed density is the pushforward of the reference measure through a differentiable transport map, so positivity and total mass are structural properties rather than learned penalties.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a geometry-conditioned neural operator on a single reference mesh instead of remeshing or changing the network discretization for every domain shape. Transport vector-valued surface features with a contravariant surface Piola map, and feed the network geometry-dependent pulled-back quantities. This should make the architecture stable across shape changes and allow batching many geometries with identical tensor shapes.
Useful7/10
Difficulty6/10
Novelty7/10