Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Insert a scalar flux-correction-style limiter after a neural operator predicts a conservative state or residual. Interpolate between a known-admissible baseline state and the learned high-order candidate, choosing the largest coefficient that satisfies a geometric family of linear inequalities encoding positive density, positive pressure, and subluminal velocity. This retains as much of the neural prediction as possible instead of independently clipping physical variables.
Paper: GQL-Based Physical-Constraint-Preserving High-Order Finite Difference Schemes for Special Relativistic Hydrodynamics in Arbitrary DimensionsarXiv:2606.31992
Replace a dense weak pairwise interaction over tokens or graph nodes by an analytically resummed Gaussian quadratic term plus explicitly evaluated corrections containing only subsets of size at most R. Choose R from the target approximation error and interaction scale instead of fixing the interaction order heuristically. This is intended for dense global attention, graph interactions, or latent-variable energy models with individually small couplings.
Replace a one-step recurrent update with a causal convolution over past affine innovations using an exponential-fractional kernel. Add mean reversion and calibrate the innovation amplitude so that activation mean and variance remain approximately invariant across sequence position while retaining long-range, power-law-like memory.
Train a scalar neural field on a bounded convex domain with a restricted half-Laplacian residual and an explicit strict-concavity barrier. The paper's theorem motivates requiring the learned potential to have negative-definite Hessian throughout the domain, while the nonlocal residual gives the model a global Cauchy-process-style inductive bias rather than only local smoothness.
Apply the paper's augmented cusp-map construction to an implicit neural layer or recurrent equilibrium, treating selected weights, gains, or input statistics as bifurcation parameters. The scanner detects parameter values where an equilibrium loses uniqueness through a fold or cusp, allowing the model to avoid unstable regions or deliberately exploit controlled multistability. Unlike merely monitoring exploding gradients, it provides a local certificate based on residual size, inverse-Jacobian…
Insert a fixed or learnable complex coordinate stretch outside the region where a neural operator models the physical interaction, so outgoing waves are damped and resonant states become ordinary discrete eigenmodes on a finite grid. Train the network with eigenvalue or resolvent losses computed after the stretch, while preserving the physical field in the interior region.
Replace dense spatial pooling or integral evaluation over a planar domain by a sparse cubature layer whose nodes are poles of a rational approximation fitted only on the domain boundary. For analytic or nearly analytic neural-field channels, the same learned field can then be integrated using substantially fewer evaluations than a uniform grid, while the boundary approximation residual supplies a cheap reliability signal.
Use a CFL-like step-size controller for neural simulators or neural ODE rollouts, shrinking the integration step when the predicted state changes rapidly and relaxing it when dynamics are smooth. The controller uses the smallest spatial resolution and maximum predicted velocity, rather than a fixed global step chosen for the worst case.
Replace step-by-step hidden-state storage in a latent ODE, state-space model, or world model with a polynomial trajectory represented independently on short time blocks. At the end of each block, pass the next hidden state by summing temporal coefficients, allowing training and inference to discard the completed block while retaining a mathematically exact block interface.