Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Use the feedbacked control-to-state norm as a conditioning diagnostic to adapt the optimizer step applied to recurrent residual outputs. When the estimated horizon amplification is large, reduce or precondition the residual-control update; when feedback makes it small, permit larger updates.
Use multilevel sensitivity of the global interaction margin to identify which neural block, connection, or parameter group is responsible for instability. This provides a targeted alternative to uniformly shrinking the learning rate or regularizing every layer.
Replace the unconstrained parameter update of a selected neural layer by a tangent update generated by a rank-two skew-symmetric operator. A Cayley transform then applies this operator while exactly preserving a quadratic parameter energy, preventing exploding or vanishing layer norms without projecting after every step. Add a separately trained scalar gain if fixed norm would otherwise reduce expressivity.
Use the M phase-aligned parameterizations produced by cyclic reformulation as an empirical ensemble of neural dynamics rather than selecting one phase or averaging only predictions. Their centroid supplies a nominal model, while their convex hull defines a low-dimensional uncertainty set used for robust rollout training and uncertainty-aware inference.
Use the paper's scattering energy balance as a measurable regularizer for an existing recurrent or state-space model instead of replacing its architecture. Penalize positive violations of the per-step energy inequality and, for paired examples, penalize violations of incremental passivity so that the model learns not to amplify perturbations over long sequences.
Add a two-sided cone-restricted spectral penalty to a recurrent or state-space model. Instead of estimating growth using a symmetric singular-value surrogate, jointly optimize a positive right vector and positive left vector in the extended quotient from the paper, targeting a real generalized eigenvalue of the learned non-selfadjoint transition operator.
Regularize a neural dynamical map so that its log-volume expansion is cohomologous to a constant rather than forcing the Jacobian determinant to be constant at every state. Learn a scalar potential that explains transient expansion and penalize only the non-telescoping component, which should reduce long-horizon gradient explosion or collapse while retaining useful average expansion.
Replace an unrestricted additive recurrent or fast-weight memory with a sign-selectable update: for each incoming update vector, choose between adding and subtracting it so that a smooth compact potential of the memory state is minimized. This is appropriate when the memory representation has sign symmetry, such as signed random features or a learned linear sketch; it is not a drop-in replacement for ordinary gradient updates where the sign carries semantic information.
Replace a uniformly discretized recurrent or continuous-depth model with hybrid hidden-state dynamics: integrate a learned drift between event times, then apply a one-sided reflection update at each irregular observation or constraint event. The reflection prevents the hidden state from violating a lower obstacle, while the explicit jump decomposition avoids smearing abrupt information changes across many small residual steps.
Replace a deterministic latent transition with a set-valued relation consisting of all next states within a learned tolerance of the predicted transition, and train the model so noisy or approximate latent rollouts are shadowed by valid exact trajectories. Use forward and inverse-limit consistency losses to make the same robustness property visible in finite sequence windows.
Prepend an adaptive Savitzky-Golay derivative bank to a temporal neural network. For each input channel and derivative order, select the local window by minimizing Stein's unbiased risk estimate, then concatenate the raw signal with the estimated derivatives. This supplies denoised velocity and acceleration features without requiring clean derivative targets or forcing the backbone to learn unstable finite-difference filters.