✗ 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
When an intervention variable is sampled from a distribution rather than fixed to a point, train a predictor on the full joint distribution instead of replacing intervention with conditioning on its realized value. This prevents selection bias caused by conditioning on mediators or downstream observations that reveal information about the random intervention.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a residual module whose state explicitly contains both a persistent context representation and an accumulator. Each residual branch computes one learned correction and adds it to the accumulator, instead of forcing every layer to represent the complete output from scratch. This provides a concrete solver-like architecture for high-dimensional regression and iterative latent prediction.
Useful7/10
Difficulty4/10
Novelty5/10
✗ Mechanism failed
2026
Replace a monolithic nonlinear latent transition in a neural world model or sequence predictor with two lifted latent channels: a global channel encoding scene-wide or sequence-wide structure and local channels encoding patches, segments, tokens, or objects. Propagate both channels with a block-structured linear operator and decode them jointly, so the encoder remains nonlinear but multi-step latent rollouts do not repeatedly apply a deep transition network.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an expensive nonlinear rollout of a recurrent or neural state-space model by a locally affine rollout whose Jacobian is evaluated once at the current state and then frozen over a short horizon. Use the resulting transition matrix as an explicit stability monitor and optionally penalize or clip its spectral radius, reducing exploding long-horizon predictions without forcing the entire nonlinear network to be globally contractive.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Use the adapted linear latent model as a cheap receding-horizon planner or training-time controller around a nonlinear neural predictor. Optimize a short sequence of latent corrections with a quadratic objective, while constraining latent states and inputs to remain inside the region where the Koopman approximation has been identified and its transition spectrum is stable.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Attach two independent critics to a learned controller: an empirical probability that executing the controller reaches a desired terminal set, and a recoverability value estimating whether the current state remains inside a safe reach-avoid region. Execute the learned controller only when both critics pass their thresholds; otherwise route to a conservative fallback policy or expert.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Train a recurrent neural network or state-space model using a Poincare-style event loss: identify two consecutive latent alignment events and require the latent position and velocity at the second event to equal a transformed version of the first. Evaluate the Jacobian of this return map and penalize unstable non-neutral Floquet multipliers, producing long-horizon trajectories that are both periodic or symmetry-periodic and locally stable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use explicitly stochastic latent dynamics to detect hidden-state changes that are invisible in the observed output spectrum. Near the integral-memory regime, constrain or monitor cross diffusion with a forward-versus-reverse path statistic, preventing output-equivalent latent models from developing physically implausible irreversible dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Replace the raw HJB residual loss of a neural PDE solver with a parametrix-preconditioned fixed-point target. At each local space-time patch, analytically propagate terminal values and source terms through a Gaussian kernel whose covariance uses a frozen diffusion matrix, while asking the network to learn only the variable-coefficient correction. This should reduce the burden on the network to represent stiff high-frequency diffusion dynamics and improve short-horizon convergence.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Modify a point-cloud message-passing or neural-operator layer so that scalar gradients, vector features, and vector-to-vector interactions are computed only in the estimated tangent plane of the surface. Projecting both feature values and derivative directions prevents the network from using arbitrary ambient-space normal directions and should improve transfer across differently embedded but intrinsically similar surfaces.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a worst-case spatial residual score with the (1-gamma)-quantile of the normalized residual field, then calibrate this scalar score on held-out operator examples. At test time, inflate the predicted uncertainty field by the conformal order statistic; the guarantee targets the fraction of spatial domain covered, producing tighter bands than max-error or Bonferroni corrections.
Useful7/10
Difficulty3/10
Novelty5/10
✗ Failed on benchmark
2026
Turn a latent recurrent model into an observer that continuously corrects its hidden state from noisy or partial observations while certifying both estimation-error convergence and disturbance attenuation. The bounded-real operator inequality becomes a trainable regularizer for a neural correction gain, providing a principled alternative to unconstrained teacher forcing or ad hoc residual correction.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Augment a 1D neural operator or transformer with explicit tokens for detected discontinuities. Advance each front analytically using the local Rankine–Hugoniot speed and train the network only to reconstruct smooth regions and the residual caused by source terms and grid resolution.
Useful7/10
Difficulty6/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 confirmed, baseline not beaten
2026
Add an observer correction to a recurrent or state-space neural model and constrain its local dynamics so latent-state errors contract according to a quadratic Lyapunov certificate. The design tolerates nonlinear residuals that are not globally Lipschitz, provided their one-sided growth and quadratic inner-bound constants satisfy a computable matrix inequality.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Add a low-dimensional feedback correction to the neural reference so that accumulated position mismatch is removed when actuator saturation or kinematic mismatch causes the shaped trajectory to lag the requested one. Unlike ordinary integral action, the correction is passed through the same feasibility-preserving reference shaper, preventing integral windup while ensuring that compensation cannot violate current, voltage, speed, or acceleration limits.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a multi-input interaction by several single-input edge channels and enforce conservation only after their signed contributions are summed at the vertices. This provides a neural architecture for composite interactions in which different channels have different drivers, while preventing the node update from inventing or destroying net internal flow.
Useful7/10
Difficulty4/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Use a fixed sparse graph for local message passing, but let each edge input be generated recursively from non-adjacent node states or latent states. This represents long-range interactions without densifying the graph, while retaining an explicit separation between local edge physics and learned global feedback.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an isotropic local mixing layer with a kinetic layer that smooths features in x and transports them in y along the characteristic direction x. The layer should be useful for phase-space data, learned simulators, and world models in which positions or transported quantities evolve through coupled drift and diffusion rather than independent Euclidean motion.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a recurrent layer whose hidden states evolve as directed phase oscillators with a prescribed nonzero common frequency and fixed phase offsets. Train task-relevant dynamics in the quotient space that removes the global phase-shift direction, so a rotating latent representation is not incorrectly penalized as unstable.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use the conformal regularity inflation law as a controller for observation placement or neural-ODE solver refinement. Sample or evaluate the learned dynamics more densely only where the predicted continuous-time uncertainty exceeds a prescribed safety radius, rather than using a uniform time grid.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Train a cheap neural surrogate globally, then use an ensemble or bootstrap covariance to identify inputs near the estimated upper-tail boundary and inputs where high-fidelity correction is uncertain. Fit a Tikhonov-regularized residual model on the acquired expensive labels and use the corrected predictor for CVaR estimation or risk-constrained optimization. The acquisition policy deliberately ignores easy central-region samples unless they influence the tail threshold.
Useful7/10
Difficulty5/10
Novelty6/10