Unverified
2026
Modify the probability-flow ODE of a reflected diffusion so that its learned velocity is tangent to the constraint boundary. Use an exact tangent projection for box or sphere constraints, or a smooth boundary-collar correction for general domains, and train with an additional penalty on the predicted normal flux. This prevents numerical trajectories from leaving the domain and targets the no-flux structure directly instead of clipping samples after each solver step.
Useful6/10
Difficulty4/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 stable diffusive state-space model with pair states formed from products of slow latent modes. Single modes represent ordinary long-wavelength diffusion, while pair modes represent the interacting hydrodynamic operators responsible for late-time tails in quartic observables. Use the pair states only for selected readout channels or a low-rank subset of mode pairs, preserving near-linear inference cost.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a conventional point-cloud decoder or density head with a concave tropical potential represented as a minimum of affine functions. Train the potential so that its Monge–Ampere mass matches the empirical point measure, encouraging a structured geometric representation that can handle variable numbers of points and atomic distributions. Use a differentiable soft-min during training and anneal its temperature toward a piecewise-affine model.
Useful6/10
Difficulty6/10
Novelty7/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
Unverified
2026
Replace a standard recurrent update with a slow-fast oscillator whose fast hidden state is coupled across feature channels by a graph-Laplacian diffusion term. The slow-fast structure permits sharp transient transitions, while diffusion suppresses unstable disagreement modes and should make long unrolled computation less sensitive to initialization and perturbations.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Train a primal neural PDE solver and a separate physical-adjoint neural solver, then use their first-order-system residuals to adaptively allocate collocation points toward regions that control a chosen quantity of interest. Instead of minimizing only the primal residual uniformly, prioritize points according to a balanced combination of primal and adjoint local residuals, because the target-output error is controlled by their global product.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use the small dielectric-anisotropy estimate to replace expensive nonlocal electrostatic solves with a local field-energy surrogate during most neural-network updates. Periodically evaluate the exact field, estimate the approximation constant, and trigger correction solves only when the observed error exceeds the predicted quadratic scale.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace isotropic particle noise or unconstrained pairwise graph updates by antisymmetric, relative-velocity-tangential noise. For each pair of particles, the update lies approximately in the hyperplane orthogonal to their relative displacement and has variance determined by a regularized soft-potential kernel. This should produce stochastic exploration while reducing center-of-mass drift and violations of kinetic-energy-like invariants.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a transport map \(Q_\theta\) from a fixed latent reference distribution to a data distribution, but expose only its locally averaged version \(\bar Q_{\theta,\sigma}(z)=\mathbb E_{u\sim K_\sigma(\cdot-z)}Q_\theta(u)\). Latent-space mollification integrates the pole-type influence singularity instead of allowing one training sample near \(Q_\theta(z)\) to dominate the quantile feature or its gradient.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a single Laplacian or fixed diffusion regularizer in a CNN with a finite positive mixture of fractional Laplacians at several orders. The resulting module separately controls short-range smoothing and long-range spatial coupling, while positivity preserves a dissipative energy and avoids the unstable behavior of arbitrary signed mixtures.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace one-shot spatial feature activation with an iterative bistable reaction-diffusion layer whose pixels or tokens settle into two metastable states while diffusive coupling removes small domains. Keep the dynamics near the pinned-to-cascade regime so inference proceeds through a small number of collective flips instead of many expensive smooth updates. This is especially suitable for segmentation, denoising, cellular neural networks, and binary latent representations.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace or augment a residual neural layer with a Fourier-domain scale-selective flow containing a learned second-order term and a fourth-order stabilizer. The block permits controlled low-frequency amplification, as required by the KS infrared mechanism, while damping high-frequency feature noise and preventing unbounded spectral growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a learnable semigroup layer that evolves features according to a positive operator combining frequency damping and spatially varying confinement. Unlike isotropic Gaussian smoothing, the layer can damp selected frequencies differently along different axes and can suppress activations in learned spatial regions, while the positive-semigroup construction prevents amplification.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a Born–Infeld/Minkowski-gradient barrier to a coordinate MLP so that its spatial gradient remains below a prescribed speed limit, rather than using an ordinary quadratic smoothness penalty. Couple the barrier with a forcing or task loss; under strong forcing, the resulting field should preferentially approach a distance-to-boundary-like profile while avoiding exploding derivatives and oscillatory solutions.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Inject Stratonovich transport noise into intermediate spatial feature maps instead of adding independent elementwise Gaussian noise. Choose divergence-free vector fields whose covariance is approximately isotropic, so the corresponding Itô correction acts like a tunable Laplacian and preferentially suppresses unstable high-frequency feature components.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use an anisotropic singular relative-position kernel in attention or graph message passing, with its exponent constrained by the paper's local integrability threshold. The module can represent sharper directional interactions than an RBF while providing an explicit certificate that its spatial gradient belongs to a chosen L^p space.
Useful6/10
Difficulty5/10
Novelty9/10
Unverified
2026
Insert a differentiable implicit layer that maps boundary features to an interior latent field by solving a discrete sinh-Gordon equation. The paper's second-order convergence result motivates using a symmetric five-point discretization and a damped Newton solve rather than asking a neural network to learn the entire interior field directly.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the usual unconstrained PINN output u_theta(x) with a latent field w_theta(x), and reconstruct the physical solution as u_theta(x) = -2 log cosh(w_theta(x)). Train w_theta to be convex while enforcing the Liouville or real two-Hessian PDE residual and the boundary condition u = 0. The transformation automatically gives u less than or equal to zero, matching the target solutions, while convexity supplies a strong global shape prior.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use one or a few explicit Coulomb transport steps on generated particles as a differentiable or detached corrector, then train the generator to imitate the corrected particles. This separates global distribution matching from the generator parameterization and can reduce adversarial-gradient noise and mode collapse.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Split a neural state into two subnetworks or two groups of latent channels and connect them through a conservative membrane flux instead of an unconstrained residual or concatenation. The flux is driven by the difference in chemical potential and uses an odd monotone exponential law, so the interface transfers information while guaranteeing nonnegative dissipation.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Use the paper's singular stopping-gain term to explicitly measure how much learned feature covariance crosses a max or routing boundary. Penalize excessive covariance in the normal direction to the switching surface, rather than pretending that the max operation has an ordinary Hessian.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a coordinate-aware long-range aggregation branch whose singular low-frequency component is explicitly centered before it is mixed into token representations. The centering acts as a neural counterterm: constant or slowly varying value fields cannot accumulate an activation contribution that grows with context size, while local and higher-frequency interactions remain available through an ordinary attention residual branch.
Useful6/10
Difficulty5/10
Novelty7/10