Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.
Replace a dense learned polynomial-feature transform with a d-orthogonal recurrence whose production matrix is constrained to a (d+2)-banded lower-Hessenberg form. The layer generates successive features using only local recurrence coefficients, giving O(dN) arithmetic and O(dN) parameters for N basis functions instead of O(N^2) dense mixing.
Construct a learnable spectral pooling block as an erosion followed by its adjoint dilation, making the resulting opening idempotent, increasing, and anti-extensive. The block can suppress frequencies outside a learned passband while guaranteeing that applying it twice does not continue changing the representation, which is useful in multi-stage CNN pyramids and U-Net skip paths.
Paper: Morphological Representation Theory in the Fourier Inf-Semilattice: Universal Decomposition of Frequency-Domain Deep Learning OperatorsarXiv:2608.20399
Use the sharp exponential tail bound to set a local clipping threshold from a desired exceedance probability. Instead of globally clipping activations at a fixed value or percentile, clip each local window at its minimum plus B log(e/delta), where delta is the tolerated fraction of clipped entries.
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.