Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
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.
Train two parameter replicas with symmetric coupling, treating one replica as a prepared thermalization packet for the other. Estimate the slow local Hessian direction and initialize or periodically reset the packet so that the coupled state has zero projection onto that mode; the target should then relax according to the next-slowest mode rather than the original bottleneck.
Introduce a periodic modulation of the local linearized training or inference dynamics and choose its frequency and amplitude using spectral stability measurements. In the slow regime, stability should be predicted by the time average of the instantaneous rightmost eigenvalue; in the fast regime, periodic modulation may suppress growth through a noncommuting, high-frequency Floquet correction even when individual instantaneous Jacobians are unstable.
Replace a dense mixing or attention matrix on tokens arranged on a Cartesian grid by a product of learned or fixed one-dimensional concentration operators. The layer applies one axis operator at a time, reducing parameter and compute cost while enforcing that the global operator is a positive contraction with controlled spectral leakage.
Use the paper's lifetime law as a controller for training or rollout difficulty. Estimate the active perturbation bandwidth R of hidden states or forecast errors and reduce the residual gain, increase the dispersion order W, or inject controlled bandwidth whenever the estimated prethermal lifetime becomes too short.
Replace an unconstrained recurrent transition with a hierarchy of features whose generator is triangular: degree-ell features depend only on degree-ell and lower-degree features. This transfers the paper's closure mechanism for even-Majorana monomials into a neural state-space model, preserving nonlinear feature interactions while making the spectrum and long-time transients directly controllable.
Replace a dense graph-attention or token-mixing matrix by a resolvent-like interaction operator and truncate it to graph neighborhoods whose radius is selected from an estimated spectral gap. Unlike fixed-window sparse attention, the sparsity level is tied to a measurable stability parameter and has an explicit exponential tail criterion.