✗ Mechanism failed
2026
Replace a conventional deep neural operator with repeated applications of one learned one-step operator whose parameters are shared across time. Train the block at a small step size and require its short-horizon compositions to match observed finite-time evolution, making depth correspond to physical or algorithmic time rather than an arbitrary number of layers.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained Euclidean diffusion sampler plus projection with a controlled diffusion whose state always lies on an embedded manifold \(\mathcal M\). The neural controller predicts a tangent vector, while the stochastic forcing is also tangent; this preserves constraints during every intermediate denoising step and avoids the bias caused by repeatedly projecting off-manifold states.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a full-resolution global flow-matching or diffusion model with a hierarchy of local velocity fields operating on progressively finer grids. Coarse levels generate long-wavelength structure and pass it to fine levels through upsampling and residual conditioning, while every velocity network uses only a locality radius prescribed by the RG bound. This should preserve long-range correlations without quadratic global attention or a full-resolution global receptive field.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace pointwise prediction of the next field with prediction of a learned flux followed by a discrete divergence. Combine Fourier spatial mixing with a causal temporal kernel over the recent resolved-history slab, so the model learns finite-memory closure effects while preserving local conservation exactly under periodic or compatible boundary conditions. The architecture should reduce spurious mass drift and improve autoregressive rollout stability on coarse-grained PDE data.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Attach one neural value head to each generalized reach-avoid subtask and compose these heads into a critic for sequential or timed temporal-logic goals. The policy is trained to increase the composed value while an auxiliary Hamilton-Jacobi residual trains each local head against the learned or known dynamics. This replaces a single poorly conditioned long-horizon objective with short-horizon certificates whose composition has an explicit logical meaning.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace pointwise differential PINN residuals with integral residuals tested against smooth functions, so the network can represent shocks without requiring derivatives of a discontinuous prediction. Add a one-sided entropy penalty to select the physically admissible weak solution rather than an arbitrary shock or rarefaction solution.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct a continuous-time SSM or neural ODE whose hidden-state dynamics use rapidly varying periodic parameters while enforcing contraction of the instantaneous Jacobian. In the high-frequency regime, replace the expensive oscillatory dynamics with an averaged SSM during long-horizon rollout; the averaging principle predicts finite-horizon trajectory convergence, while contraction predicts stable long-time behavior.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a full-resolution neural operator with an explicit multiscale reconstruction: a coarse predictor produces a low-resolution field, and a small corrector module combines its gradients and Hessians with learned rapidly varying basis functions. The model should recover fine detail without running the expensive backbone at fine resolution.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Construct a spatial recurrent network whose local vector hidden state has two stable attractors and whose neighbor coupling is diffusive. Train or constrain the network so that the desired attractor invades the undesired one with a controlled positive front velocity, rather than relying on a scalar class-frequency variable that can erase depletion and interface structure.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a continuous spatial trunk and a pole-constrained modal state-space branch into a spatiotemporal predictor. The model represents a field as a sum of learned spatial modes and exponentially evolving modal coordinates, so long-horizon behavior is controlled by explicit poles rather than by an unconstrained recurrent transition matrix.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace full-state prediction in a neural simulator or neural operator with prediction of a perturbation around a cheap structured background trajectory. Compute the background defect and known linearized or nonlinear corrections explicitly, and let the neural closure model only the remaining residual. Add a residual-magnitude gate so the learned closure is suppressed when the structured solver already explains the target dynamics.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Approximate stochastic neural-network training by a diffusion in parameter or representation space and train a scalar neural quasipotential using the stationary Hamilton-Jacobi residual. The resulting barrier between training basins becomes a quantitative monitor of metastability and can guide learning-rate, noise, or restart decisions.
Useful8/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained residual or state-space update by a discrete conservative stochastic balance law. The neural network learns nonlinear mode-coupling fluxes, while the dissipative operator and injected noise are tied by a fluctuation-dissipation relation so that the model has a controlled stationary distribution rather than unconstrained activation drift.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace repeatedly applied unconstrained message passing or recurrent transition maps with a transport layer containing a coherent hopping branch and an explicit dephasing operator. Small dephasing preserves sharp, oscillatory propagation, whereas large dephasing suppresses inter-position correlations and produces stable diffusion-like receptive-field growth, which should reduce long-horizon ringing and exploding sensitivities.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the pointwise strong-form PINN loss with a vector of localized weak residuals generated by fixed compactly supported polynomial test functions. Use a neural network or KAN as the trial function, integrate by parts once, and evaluate each test residual with Gauss–Legendre quadrature; this lowers the required derivative order and prevents a few high-curvature collocation points from dominating training.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace pointwise high-order PINN residuals with a stochastic one-step residual evaluated on Brownian transitions. A single scalar network produces the value, gradient, and Hessian by automatic differentiation, and the quadratic centered increment supplies a stochastic probe of the Hessian. Add a terminal gradient penalty so the learned full jet is constrained at the terminal boundary, not only the scalar value.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Train a primal state network and a dual flux network jointly, using the convex primal-dual gap as the main loss and as an a posteriori certificate of state error. Unlike a strong residual, the certificate is based on monotonicity and convex duality, so it can remain informative even when differentiating rapidly oscillatory coefficients would amplify noise by $1/\varepsilon$.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a single neural representation of a rapidly oscillatory PDE solution by a macroscopic network plus an explicitly oscillatory corrector network. Feed the network both the slow coordinate $x$ and fast coordinate $y=x/\varepsilon$, and train the resulting composite field in a variational energy objective. This targets the paper's scale-robust approximation bound rather than forcing the optimizer and finite sample set to discover oscillations of wavelength $\varepsilon$.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained high-dimensional recurrent hidden state with a low-dimensional nonlinear invariant manifold attached to a selected spectral subspace of the hidden-state linearization. Learn both the manifold graph and its reduced nonlinear dynamics, then roll out the reduced coordinates for long horizons while reconstructing the full hidden state only when needed.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained neural flux Jacobian with a matrix of the form \(A(u)=H(u)^{-1}S(u)\), where \(S(u)\) is symmetric and \(H(u)\) is the positive-definite Hessian of a strictly convex entropy. Because \(A(u)\) is similar to a symmetric matrix, every characteristic speed is real. Reconstruct the flux by integrating this Jacobian along a fixed path from a reference state, and use the resulting module inside a differentiable finite-volume solver or learned dynamical model.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach an online PDE-constrained reconstruction layer to a neural operator instead of accepting its raw output field. The layer stays close to the network prediction at sampled output locations while minimizing a differentiable PDE residual and boundary-condition violation, allowing physics correction for each new input without retraining the neural operator.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the standard squared pointwise PDE residual in an elliptic PINN by its discrete $H^{-1}$ norm. The residual is passed through an inverse Dirichlet Laplacian, reducing the dominance of rapidly varying residual modes and acting as a mathematically specified preconditioner for the PINN training gradients.
Useful8/10
Difficulty5/10
Novelty7/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 confirmed, baseline not beaten
2026
Add an explicit transport-delay state to a recurrent neural network, state-space model, or learned optimizer whenever actions, gradients, or control inputs arrive after a fixed delay. Use the queued inputs to construct a finite-horizon predictor state and apply the neural transition or controller to that predicted state rather than to the stale state. The design transfers the paper's delay-as-transport-PDE and backstepping-to-stable-target strategy into a differentiable predictor with an…
Useful7/10
Difficulty6/10
Novelty6/10