Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Regularize a recurrent or state-space model using finite-time Lyapunov exponents of its actual hidden-state transition products. Penalize collapsed adjacent exponents while also controlling the largest exponent, encouraging several useful state directions instead of one dominant direction or universal contraction.
Replace an explicit Euler residual update for a skew-coupled hidden state with a five-stage palindromic composition of exact shear maps. Use a=1/4, the unique real coefficient maximizing the analyzed spectral CFL interval, and adapt the step size from an estimate of the learned coupling operator's spectral norm.
Replace a directed sequence-memory chain with a circular recurrent state propagated by a learned delayed convolution. The same learned kernel can support forward and reverse replay because replay direction is a dynamical mode of the ring, rather than requiring plasticity to explicitly learn both forward and backward synapses.
Add a bank of temporal branches whose synapses apply heterogeneous delays before coincidence pooling. A branch selectively responds to an ordered pair or short sequence when the delay difference compensates the sequence interval, while low delay dispersion makes it primarily an order-invariant event detector. The branch threshold creates sparse, interpretable activations that can replace part of a recurrent or attention-based temporal module.
Use a Sylvester equation as an implicit parameterization of a recurrent or state-space transition matrix, while regularizing the actual solution X rather than only the coefficient matrices A and B. The key mechanism is to suppress small singular values of X and near-resonant eigenvalue pairs, which otherwise amplify selected components of the learned transition.
Use the paper's multiplicative spectral law to initialize a recurrent or state-space transition matrix as a deterministic operator multiplied by a unitarily invariant random factor, then choose the factor scale so the predicted complex eigenvalue support lies near a target stability annulus. This directly targets long-horizon gradient preservation instead of relying only on singular-value normalization.
Build a recurrent or state-space model with latent coordinates split into tangent variables that carry the modeled dynamics and transverse variables that contract toward a learned invariant manifold. Penalize violations of invariance and enforce a spectral gap between tangent and transverse Jacobian dynamics, preserving useful noncontracting behavior while suppressing off-manifold drift during long rollouts.
Normalize a learned symplectic recurrent transition using the paper's explicit positive-definite factor instead of projecting the entire matrix onto an orthogonal group. Retain the compact unitary dynamics as the stable transport component and separately damp only the noncompact factor, providing a tunable stability mechanism that preserves symplectic structure.
Build a recurrent or state-space layer with fixed, spatially heterogeneous relaxation rates and measure its steady response to positive versus negative input offsets. Unlike a homogeneous linear state-space model, an individual heterogeneous realization can generate a controlled even response, allowing directional transport, asymmetric temporal context, or hysteresis-like sequence transformations without inserting an explicit quadratic input feature.
Replace a recurrent, SSM, or residual linear operator W by an exact affine image of a contractive matrix sigma. The resulting W lies in a prescribed matrix ball and, for the positive-real choice of parameters, satisfies a sector inequality such as W+W^* >= 0. This gives an anisotropic, learnable alternative to plain spectral normalization: the allowable operator set is convex and its center and left/right radii can encode known directional scales.
Train a recurrent or state-space world model as a semiconjugate factorization: the high-dimensional state dynamics \(G\) must project through an encoder \(E\) to a lower-dimensional latent map \(F\), satisfying \(E\circ G\approx F\circ E\). Add a connected-fiber regularizer so states with the same latent code form geometrically coherent sets, allowing the model to discard redundant microscopic motion without discarding the entropy-carrying macroscopic dynamics.
Attach a small, online-adapted Taylor-polynomial residual model to a neural dynamics model instead of adapting all network weights. Construct the dictionary from the local Taylor structure, remove monomials forbidden by known joint-odd symmetry, and update its coefficients with recursive least squares. This yields fast adaptation with an interpretable parameter count and a direct test of whether the assumed symmetry is valid.
Replace an untied stack of recurrent or polynomial-filter blocks with a delayed recurrence whose coefficients repeat with period r and whose characteristic polynomial has exact (r+1)-fold rotational symmetry. The resulting layer couples the current state to a state r steps back, producing a structured spectrum rather than arbitrary eigenvalues and potentially improving long-horizon propagation with fewer parameters.
Represent an intermediate hidden-state matrix as a low-rank factorization and replace a dense residual update by a repeated contractive step followed by hard SVD truncation. Increase or decrease the rank automatically so that the discarded Frobenius-norm tail is below a specified tolerance, providing an explicit accuracy-memory tradeoff instead of fixing the rank in advance.
Regularize a recurrent or continuous-time state model according to the response residues of its slow Jacobian modes, rather than penalizing every small eigenvalue equally. A mode is penalized only when it is both dynamically slow and strongly coupled to the chosen output, loss, or input perturbation, preserving useful slow memory while suppressing dangerous amplification.
Add an explicit memory field to a recurrent or state-space model and make the memory feedback act through a discrete biharmonic operator, producing the paper’s characteristic \(z=4\) long-wavelength relaxation. This should preserve slowly varying sequence structure while damping high-frequency hidden-state noise, potentially improving long-horizon prediction without requiring a very large recurrent state.
Replace a single recurrent hidden state by reciprocal forward and backward feature fields whose product defines a positive feature density. Feed the associated Bohm/Fisher potential back into both streams, creating adaptive curvature feedback that suppresses sharp incoherent relative structure and can localize the learned representation.
Replace an unrestricted recurrent state with a current input-driven state coupled to a fading average of its own history. The memory coupling provides a distributed dissipative channel, while the recurrent Jacobian is constrained below a measurable contraction boundary. This creates a recurrent or state-space block whose long-horizon sensitivity can be tested against explicit characteristic roots.
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Use the determinant and trace-power identities of the rules matrix as a spectral diagnostic for recurrent or state-space training. Penalize unstable or excessively resonant modes through a truncated log-zeta objective, while retaining selected eigenvalues near the unit circle when long memory is desired. This gives a falsifiable transition criterion based on closed-walk growth rather than only gradient norms.
Augment an RNN or state-space model with a finite-state binary-context module whose transitions are those of a de Bruijn graph, while a signed transition channel records a quadratic parity function of the recent context. The exact finite-memory branch preserves cancellation-sensitive parity features that a continuous hidden state may forget, and a learned readout can combine it with the ordinary neural state.
Replace the fixed delay in a temporal layer with a distribution of physically structured delays induced by uncertain transport velocity. The layer aggregates features arriving at several travel times and can use the deterministic mean-velocity path during most training steps, periodically correcting it with stochastic samples.
Replace a standard recurrent or neural-CDE Euler transition with a second-order rough transition that receives both first-order increments of the input path and learned second-order branched increments. Unlike a geometric signature block, the second-order coefficients are independent learned maps rather than being forced to equal derivatives or shuffle-symmetric combinations of first-order vector fields, allowing the model to represent order-sensitive and non-geometric interactions in irregular…
Replace a local smoothness penalty or local state transition along a sequence or depth coordinate by a marginal fractional quadratic energy with Fourier multiplier |k|. The sigma=1 kernel is nonlocal and scale-free, so it can preserve long-range correlations while suppressing high-frequency instability more selectively than an ordinary Laplacian penalty.