Unverified
2026
Apply an inverse-square Calogero barrier to the eigenvalues of a recurrent or state-space transition Jacobian, discouraging unstable eigenvalues and pathological eigenvalue collisions without forcing the matrix to be Hermitian. The paper's non-Hermitian scattering picture motivates treating the spectrum as correlated rather than assuming an ordinary pairwise Coulomb gas; the inverse-square term is used as a local, computable surrogate for that mechanism.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Regularize the state-transition or input-output Jacobian of a recurrent, state-space, or implicit neural network so that its complex eigenvalue cloud belongs to a selected non-Hermitian symmetry class and has the corresponding unfolded pair statistics. Combine this statistical-shape constraint with an explicit spectral-abscissa or spectral-radius margin, preventing the network from obtaining good average singular values while remaining highly non-normal and transiently unstable.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Equip a neural tracker with an explicit discrete posterior over candidate latent states, or approximate that posterior with particles or an ensemble, and monitor both its spread and its distance from the target or delayed supervision signal. Under likelihood-temperature misspecification, use the paper's two failure modes as a controller: flatten an overconfident posterior that is localized at the wrong state, while increasing observation trust when the posterior is diffuse but evidence is…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a sparse heavy-tailed nonlocal mixing operator into a residual sequence, graph, or spatial network so that information can traverse distant positions without stacking many local layers. Use the critical tail exponent s = 1/2, whose truncated first moment grows logarithmically and predicts an effective propagation distance proportional to depth times log depth rather than merely depth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent or residual linear transition with a matrix generated through the paper's twisted Cayley chart and exact exponential flow. The layer evolves a constrained operator analytically rather than learning arbitrary weights, while retaining trainable symmetric chart coordinates and a continuous time-scale parameter.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a fixed, spatially correlated perturbation field to every layer of a CNN or 2D state-space model, with the perturbation decomposed into transverse and longitudinal Fourier components. Unlike ordinary injected noise, the same field is reused for all training examples and all forward passes, allowing it to act as a structured architectural flow that can promote global feature alignment. Sweep the transverse fraction at fixed total perturbation variance and test for the predicted ordering…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use two bounded self-adjoint transition operators in a recurrent or state-space block and penalize their normalized Hilbert--Schmidt commutator. When the penalty is small, the paper guarantees that the pair is close to exactly commuting operators, suggesting a controlled path to a shared eigenbasis and cheaper coordinate-wise dynamics. Add an optional numerical repair step that projects the learned pair toward a simultaneously diagonalizable pair.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a low-dimensional, trusted sentinel state to the optimizer or recurrent inference controller. The sentinel is driven by a secret probe and a protected gain, so unauthorized gain changes produce a predictable shift in its equilibrium even when the main neural dynamics remain numerically stable. Monitor the estimated equilibrium and trigger rollback or quarantine when the measured shift exceeds the expected noise envelope.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace the dense output of selected linear projections with a two-sided magnitude threshold that emits zero for small values but preserves signed large values. Learn one positive threshold per projection, or optionally one threshold per output channel, so the network discovers where sparse events can be removed while retaining outlier information.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Replace an explicit recurrent transition with a learned descriptor relation in latent space, allowing some latent coordinates to satisfy algebraic constraints rather than being numerically integrated. Fit the relation using total-least-squares or iterative PCA on the jointly observed trajectory, so noise in every channel is treated symmetrically and the model can discover whether the latent system is index-0 or index-1.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the recurrent transition or state-space mixer with a reversible transport followed by complementary relaxation of symmetric and antisymmetric feature components. The construction preserves a weighted energy and damps both parity sectors, giving bounded long-horizon powers without requiring the learned transition matrix itself to be symmetric. A numerical-range ellipse can be used as a cheap training-time certificate against transient growth.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use exhaustive finite-state analysis as an architecture-search objective for coupled recurrent motifs. Instead of independently tuning a normalization gate and a WTA gate, enumerate their possible interfaces and select couplings that create group action only on a small joint image set, yielding controlled reversible subdynamics embedded in an otherwise dissipative system.
Useful6/10
Difficulty6/10
Novelty9/10
Unverified
2026
Constrain the learned coefficients of a high-order linear recurrent or state-space layer using the block Hurwitz matrix associated with its matrix characteristic polynomial. Penalize near-singular Hurwitz blocks and, for degrees two and three, optionally enforce positive leading Hurwitz determinants; use companion-matrix eigenvalues as the definitive stability check rather than trusting determinant positivity at degree four or above.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Initialize or regularize recurrent matrices so that each unit receives an approximately cancelling sum of positive and negative weights, while keeping the global variance and spectral radius fixed. Sweep a continuous balance parameter instead of imposing balance blindly, because the paper predicts qualitatively different behavior for saturating, sub-linear, and odd nonlinearities.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Apply the paper's quiver-semistability viewpoint to a graph-structured state-space layer, treating each node's latent state space as a quiver vertex and each message-passing or coupling matrix as an arrow. Penalize approximately invariant collections of node subspaces that receive little signal from the input, so the learned latent dynamics cannot hide useful information in unreachable subnetworks. A dual output-side penalty can prevent predictive information from becoming confined to…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace an unconstrained recurrent transition matrix with a J-selfadjoint matrix A, where J is a fixed diagonal signature matrix with only a small number of negative entries. Add a sampled Kreiss-resolvent penalty to suppress transient amplification while preserving the expressive dimension of the hidden state. The paper's bound predicts that worst finite-time amplification depends on the smaller inertia index rather than the full hidden dimension.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace the raw position/channel basis of a one-dimensional sequence module by eigenvectors of the projected cubic radial kernel matrix. Penalize or truncate coefficients in eigenmodes with many sign changes, giving a mathematically ordered smooth-to-oscillatory inductive bias while preserving the two-dimensional nullspace corresponding to affine trends.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Construct a graph-based latent state whose velocities evolve through free-flight updates and pairwise elastic collision operators. Each collision operator is orthogonal, so total latent kinetic energy is exactly conserved; a connected interaction graph is intended to eliminate unwanted component-wise polynomial invariants and improve long-horizon stability.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a neural state-space model with an explicit first-order input-to-output path instead of forcing every output to depend only on deeply propagated hidden states. Penalize or reject learned linearizations whose transfer matrix has relative degree greater than one, then train a storage-function certificate for the remaining passive dynamics. This preserves the paper's relative-degree compatibility condition while allowing high-order internal memory.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an Erlang delay or exponential smoothing cascade in a recurrent or state-space layer by a positive rational kernel of the form \(\kappa(u)=C e^{-a u}p(u)^2\). Choose the degree-\(m\) polynomial by deleting the adjacent pair of Laguerre zeros with smallest relative gap from \(L_{m+2}\), then rescale the resulting density to unit mean. This preserves a nonnegative impulse response while reducing temporal jitter relative to Erlang filters.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a recurrent or state-space network with time-dependent transition parameters, but train it to forget perturbations at a common exponential rate across all admissible parameter schedules. The model should retain task-relevant long-term signals while suppressing dependence on arbitrary initial hidden states, reducing instability under changing inputs, curricula, or deployment-time dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent hidden-state channel with a two-dimensional oscillator constrained to the supercritical Hopf normal form. A learned control parameter can place the channel below threshold for decaying dynamics or above threshold for sustained periodic dynamics, while the cubic term bounds the amplitude and prevents recurrent-state explosion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
For a neural dynamical predictor, train or maintain several independently initialized models and aggregate their multi-step states using the signed displacement along the locally unstable forecast direction. The key mechanism is cancellation of opposite unstable-manifold errors: ordinary averaging should reduce this component at rate N^{-1/2} when errors are independent and centered, while robust aggregation should be activated when validation residuals show heavy tails or persistent bias.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Construct a residual neural network or graph message-passing layer whose skip edges are sampled with probability proportional to their distance as $|i-j|^{-(1+\sigma)}$, while retaining a small local backbone. The paper's mechanism predicts that coarse-grained propagation is governed by the long-range kinetic operator and is therefore asymptotically insensitive to the particular Bernoulli graph realization, yielding controllable superdiffusive information transport without dense all-to-all…
Useful6/10
Difficulty5/10
Novelty7/10