✗ 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
✓✓ 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
△ Mechanism confirmed, baseline not beaten
2026
Build each one-step operator as a maximum over a compact set of learned or discretized action branches, with a branch-dependent penalty. This directly imports the envelope structure used for nonlinear semigroups and gives a neural architecture suited to HJB equations, robust prediction, and stochastic control under model uncertainty.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Make a neural network predict a vector potential rather than a magnetic or velocity field, then obtain the physical vector field with a fixed differentiable discrete curl. The reconstructed field satisfies the discrete divergence-free constraint exactly, eliminating divergence-penalty tuning and preventing constraint drift during long rollouts.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a neural local reconstruction into a finite-volume or graph-based simulator, but hard-cap its contribution so every reconstructed state remains in the physical admissible set. The network learns accuracy-sensitive gradients or stencil weights; a deterministic limiter, rather than a penalty loss, guarantees positive density and pressure for arbitrary network outputs.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Build a neural PDE surrogate that predicts changes in equilibrium variables rather than changes in conservative state variables. The network receives the local state and geometry, predicts an equilibrium-coordinate increment, and subtracts the network output evaluated at a reference equilibrium, forcing the reference state to have exactly zero learned residual.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Construct a spatiotemporal neural block from localized functions of a learned parabolic operator instead of unrestricted attention or convolution. Use one filter for fine-scale diffusion and another for coarse-scale temporal aggregation, with the scale ratio controlling information propagation. The block should suppress distant interactions while still permitting long-range mixing through coarse filters.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Use separate measurement-domain and target-domain token sets so a network can infer a field on one spatial domain from sparse observations on another in one forward pass. The same decoder can answer arbitrary target query points, avoiding an optimization loop for each inverse instance.
Useful7/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a Cartesian grid or singular polar convolution near the center of a disk with a hierarchy of polar-spline coefficient features. Use separate coefficient spaces for scalar fields, vector 1-forms, and 2-forms, together with sparse derivative matrices satisfying the discrete complex identity D1 D0 = 0. Refine only cells with large learned or physics residuals, while retaining the pole constraints that make the representation smooth despite the collapsed angular boundary.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace repeated high-dimensional quadratic interactions in a neural operator or world model with a reduced latent quadratic map whose basis-pair interactions are precomputed offline. The online computation becomes a small polynomial in latent coefficients, preserving quadratic interaction structure while avoiding repeated full-resolution contractions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary dropout or soft sparsity penalties on a nonnegative spatial or token activation field with sublinear multiplicative stochastic dynamics. The field receives local diffusion or graph smoothing, while noise amplitude u^gamma vanishes at zero but is relatively strong near zero; this creates an absorbing zero state and may produce exact contiguous inactive regions. The module is suitable for feature maps, graph-node fields, token routing scores, or continuous neural operators.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a neural interaction layer for multiple populations whose cross-population kernels are ordered, so the response of population s to population t need not equal the response of t to s. Evaluate the interaction in divergence form and apply an explicit moment-nullspace projection so each layer preserves total mass, momentum, and energy instead of learning these constraints from penalties.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace dense attention weights with a compactly supported anisotropic bump derived from the obstacle solution, using one learnable ellipsoid per attention head or feature group. Tokens outside the learned ellipsoid receive exactly zero weight, while tokens inside receive smoothly decaying weights according to a fractional exponent. The learned positive-definite matrix represents orientation, scale, and correlations between feature dimensions.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Add a pressure-like recurrent state to a neural surface-flow decoder and update it from the predicted local divergence, creating a learned or fixed feedback loop that drives vector outputs toward local incompressibility. Unlike a static divergence penalty, the state can accumulate constraint violations and produce corrective tangent gradients at each refinement step.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace pointwise high-order derivative residuals in an eigenvalue PINN by an assembled dynamic-stiffness residual \(\mathbf W(\omega)q_\theta\), where each element matrix is obtained from homogeneous PDE solutions. The network predicts nodal degrees of freedom or element boundary traces, while the exact frequency-domain operator enforces the physics without differentiating the network multiple times with respect to coordinates.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a differentiable reaction-diffusion layer that converts dense token or pixel features into sparse, spatially coherent routing masks. Two competing orientations form complexes through conserved monomer reservoirs, so local assignments can cluster while opposite assignments mutually exclude one another instead of independently activating at the same location. The layer can be used as a soft-to-hard MoE router, attention-mask generator, or object-part grouping module.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment the coordinate embedding of a neural operator, PINN, or coordinate MLP with Chebyshev features plus rational features whose poles are selected by the AAA rational approximation algorithm. The rational features should represent boundary layers and other localized singular structures with fewer channels than a high-degree polynomial basis, reducing Gibbs-like oscillations and improving accuracy at small diffusion-to-advection ratios.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Split a learned dynamical model into a slow nonlinear transport branch and a stiff fast-coupling branch, evaluating the former explicitly and solving only the latter with a small implicit iteration. This should permit larger rollout steps when latent fast modes have large Jacobian eigenvalues while retaining expressive nonlinear dynamics in the explicit branch.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace a standard graph-convolution propagation step with a short time integration of the nonlinear graph flow \(\partial_t u=\Delta_p(u^q)\). The pointwise power \(q\) and gradient exponent \(p\) create state- and edge-gradient-dependent propagation: small signals can be suppressed or amplified by \(q\), while large graph discrepancies receive nonlinear diffusion controlled by \(p\). Use nonnegative feature states and conservative edge fluxes so the layer inherits positivity and total-mass…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a single local message-passing or convolution operator by a spectrally controlled mixture of fractional and ordinary diffusion. The exponent σ is learned or scheduled, while a crossover gate forces the model to change parameterization near the renormalization-group threshold σ*=2, allowing long-range propagation when useful without retaining an unnecessarily nonlocal operator at short scales.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a finite-element surrogate by minimizing the assembled discrete potential energy rather than a loss against solved displacement labels. The objective uses only the sparse stiffness matrix and load vector, while its exact energy-gap identity makes it equivalent to supervised regression in the stiffness norm.
Useful6/10
Difficulty3/10
Novelty5/10
Unverified
2026
Replace a single graph or token-mixing operator with two coupled channels: an antisymmetric, coherence-preserving transport channel and a state-dependent dissipative diffusion channel. The local feature state controls the dissipative edge rates, so strongly occupied or conflicting regions are smoothed while weakly interacting regions retain rapid coherent propagation.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent every predicted displacement and velocity as the sum of a prescribed boundary lift and a learned residual that is identically zero on the Dirichlet boundary. Feed the boundary velocity into the model through an explicit distributed-port feature and train an energy-balance residual so that the learned interior dynamics cannot inject arbitrary energy at the constrained boundary. This should eliminate boundary drift and reduce the burden on penalties or projection layers.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Augment a local convolutional block with a fractional nonlocal-gradient branch that aggregates directional feature differences over multiple spatial scales. The residual branch gives each location access to long-range variation while preserving the property that constant feature fields produce zero response. A learnable residual gate allows the network to suppress the branch if nonlocal interactions are unhelpful.
Useful6/10
Difficulty5/10
Novelty7/10