✗ 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
✗ 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
Train a neural trial function for an elliptic PDE using a very-weak residual in which all derivatives act on fixed smooth test functions rather than on the neural network. This eliminates second-order reverse-mode or forward-mode automatic differentiation and allows low-regularity activations while retaining a least-squares objective over many test functions.
Useful8/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
Make a neural network predict a positive Gaussian-mixture representation of the distribution function rather than independent values on a momentum grid. Use the mixture parameters inside a differentiable Boltzmann collision operator, so training directly enforces the interaction mechanism and exposes the relaxation spectrum responsible for ballistic-to-hydrodynamic crossover.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Build a Bloch-conditioned neural model whose periodic-factor representation transforms covariantly when the supplied Bloch wavenumber is shifted by a reciprocal lattice vector. Either canonicalize q to the first Brillouin zone or augment training with mathematically paired examples whose outputs differ by the exact phase gauge. This prevents the network from learning inconsistent predictions for physically identical Bloch modes.
Useful7/10
Difficulty4/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Train a frozen-feature or linearized neural network by residual least squares on deterministic quasi-uniform points rather than independently sampled collocation points. The paper's norm-equivalence result predicts that, once the number of residual points is proportional to the number of active features, the empirical residual controls the continuous residual and avoids random undersampling of localized errors.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an ordinary contracting recurrent state with two spatially coupled competing latent populations whose nonlinear interaction admits a stable finite-amplitude coexistence state even when the infinitesimal invasion eigenvalue is negative. This creates hysteretic, robust memory: a representation survives small perturbations and weak evidence, but can be switched by a sufficiently large input pulse.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Combine the very-weak residual with step activations and one-bit weights, so the deployed PDE solver uses threshold and binary operations while training still optimizes a differentiable surrogate. The weak objective only needs values of the trial function and therefore does not require differentiating discontinuous activations with respect to spatial coordinates.
Useful7/10
Difficulty6/10
Novelty4/10
△ Mechanism confirmed, baseline not beaten
2026
Build a complex-valued coordinate map q(x) whose components are harmonic and whose gradients are mutually null, then feed q(x) into an otherwise unconstrained neural function v. Any learned output of the form u(x)=v(q(x)) is analytically harmonic when the constraints are satisfied, so the network does not need to rediscover the Laplace structure from collocation data. This is especially suitable for two-dimensional elliptic PDEs, where q=x+iy is the canonical example.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Represent the physical wavefunction as a fixed cusp factor multiplied by a neural residual, rather than forcing the network to learn Coulomb singularities from data. Use cutoff distance features so the factor is nontrivial only near coalescences and remains numerically bounded at long range. The residual should have substantially lighter Fourier tails and therefore require less network capacity to attain a given energy or local-energy accuracy.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace soft boundary penalties in neural operators with a hard projection onto a finite-dimensional span of homogeneous Dirichlet Laplacian eigenfunctions. Every projected hidden field is identically zero on the boundary, while increasing the number of retained eigenfunctions recovers the expressive capacity needed for operator approximation.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use cumulative control measures as the input to a neural surrogate instead of the full sequence of control values. For a quasi-static free-boundary system satisfying the paper's average-pressure path-independence assumption, two nonnegative control histories with identical integrals up to time t should produce the same state at t, allowing a smaller training input and fewer distinct control trajectories in the dataset.
Useful6/10
Difficulty4/10
Novelty8/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
Add a stochastic pairwise regularizer that penalizes only coordinate pairs whose normalized neural-field difference exceeds a threshold. Unlike a conventional fractional Sobolev penalty, the weak-type functional uses an indicator and a distance weight, and its Gamma-limit guarantees convergence toward a local gradient energy as the threshold grows.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a fractional Sobolev penalty to the spatial output of a neural field or reconstruction CNN, rather than relying only on pixelwise weight decay or total variation. The fractional order s continuously controls high-frequency suppression, allowing an experiment to test whether s less than 1 preserves edges better than the classical integer-order penalty while still reducing noise and unstable oscillations.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
For neural eigenmode solvers on periodic domains, train the full field directly and impose Bloch phase coupling only at opposite cell boundaries, rather than differentiating a periodic factor with respect to q through a quadratic volume operator. The boundary formulation preserves reciprocal-lattice equivalence exactly through z=exp(iqa), reducing spurious eigenmodes caused by inconsistent q-dependent discretization.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Insert a differentiable Fourier-domain layer after a network predicts a symmetric strain field, projecting every frequency onto the subspace satisfying isotropic mechanical equilibrium. The projection is a closed-form least-squares correction, so the network cannot spend capacity representing large equilibrium violations and the resulting field is physically admissible by construction.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a tensor-product network over a low-dimensional state and a large distribution embedding with a neural operator that consumes the distribution vector once and outputs values on a finite-difference grid in the low-dimensional state. Train it with the governing PDE residual, explicit boundary residuals, and optional signed shape constraints, allowing the network to preserve numerical structure that a generic MLP would learn only implicitly.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the network-space inverse inequality to choose derivative order, collocation resolution, and feature separation jointly instead of enforcing arbitrarily high-order residuals on an under-resolved network. This creates an anti-aliasing rule: a network whose parameters are separated by \(\underline h\) cannot represent high Sobolev frequencies without a factor \(\underline h^{-(r-s)}\), so derivative penalties above the resolvable order should be disabled or accompanied by refinement.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent the predicted solution as $u_{\theta}(x)={\rm d}_{\Omega}(x)^s v_{\theta}(x)$, where $v_{\theta}$ is an unconstrained neural network and ${\rm d}_{\Omega}$ is the distance to the boundary. This builds the fractional Dirichlet boundary layer into the architecture and leaves the network to learn the smoother quotient $u/{\rm d}_{\Omega}^{s}$, which the paper proves extends Hölder-continuously to the boundary when the reaction has sufficient integrability.
Useful6/10
Difficulty4/10
Novelty6/10