Unverified
2026
Replace an optimizer's endpoint-only step acceptance rule with a robust envelope rule that requires all monitored neural-network constraints to remain feasible for every interpolation point between the old and proposed parameters. This targets transient instability during a large update, such as exploding activations, loss spikes, negative curvature, or violation of a spectral-norm budget, even when the final endpoint appears acceptable.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the usual linear predictor in continuation of an implicit neural state with a fractional-power predictor fitted from recent states, then correct the prediction using a pseudo-arclength constraint. This is designed for equilibrium layers, implicit sequence models, or homotopy training schedules where the state Jacobian becomes nearly singular and ordinary Newton correction or fixed-point iteration becomes unstable.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a state-space layer whose latent dynamics use a fixed cyclic schedule of learned generators instead of a single generator. Penalize pairwise commutator norms so that the true ordered cycle remains close to the averaged flow, while periodically checking a quadratic Lyapunov contraction condition on the exact cycle transition.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Model the scalar feedback route in a recurrent layer as a rank-one perturbation of its open-loop transition. Regularize the frequency response of that route so that no mode reaches unit loop gain, directly targeting oscillatory and slowly decaying instabilities rather than relying only on gradient clipping.
Useful6/10
Difficulty6/10
Novelty6/10
✓ Mechanism works
2026
Replace unconstrained per-frequency recurrent dynamics in a Fourier neural operator or spectral state-space model with oscillators initialized from the plasma dispersion relation \(\omega_k=\sqrt{\underline{b}^{2}+|k|^{2}}\). Each Fourier mode first undergoes a norm-preserving rotation at its prescribed frequency, while a small learned residual and optional nonnegative damping account for task-specific dynamics. This should reduce phase drift and exploding or vanishing activations when modeling…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace pointwise spectral normalization of an RNN transition with a stability constraint on the entire family of input-conditioned matrices. Use a learned positive-definite metric P so every transition contracts in the same state geometry, approximating the paper's uniform exponential stability and input-forgetting guarantee.
Useful6/10
Difficulty5/10
Novelty6/10
✓ Mechanism works
2026
Replace spectral-radius-only stabilization of a recurrent or state-space transition matrix with a numerical-range constraint. Penalize directions in which the Hermitian part of a rotated transition matrix has a large maximal eigenvalue, controlling nonnormal transient amplification and polynomial state propagation.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a standard nonlinear recurrent transition with a truncated Carleman lift containing levels $z_j\approx u^{\otimes j}$, coupled by linear maps that represent quadratic, linear, and forcing terms. The resulting transition is linear in the lifted state but still expresses nonlinear dynamics in the original state, while the highest-order omitted interaction supplies an explicit truncation-defect signal that can be used for adaptive order selection or regularization.
Useful6/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Insert a weighted negative-semidefinite fourth-order mixing operator into a residual or state-space layer. Instead of learning an unconstrained token-mixing matrix, parameterize its dissipative component as Q = -a W^{-1} B^T W B, ensuring that this component cannot increase the chosen weighted feature energy. Use a boundary-aware finite-difference matrix B along the sequence axis, optionally with learnable banded coefficients while preserving the factorization.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add a diagnostic and optional regularizer that measures whether a neural block's multi-step directed interactions differ strongly when traversed forward versus backward. This catches transient directional amplification in deep acyclic or nearly nilpotent networks, which eigenvalue or spectral-radius penalties can miss because all eigenvalues may be zero even though short directed walks are large.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a contractive recurrent transition by its explicit Schäffer isometric lift, optionally augmenting it with a second operator satisfying the nonlinear covariance relation $V_1V_2=V_2f(V_1)$. The lifted state preserves or nearly preserves hidden-state energy, while the covariance penalty or parameterization imposes an algebraic structure on multiple recurrent channels.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a cheap spectral gate to a state-space model or recurrent event detector that decides whether multi-step lookahead can change the threshold decision. If the learned threshold readout is approximately a nonnegative left eigenvector of the transition matrix, use the current state only; otherwise activate predictive heads and search over a small horizon. This avoids unnecessary rollout computation while preserving early-warning behavior in oscillatory or rotating dynamics.
Useful6/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace or augment a low-dimensional recurrent transition with affine maps whose linear parts belong to a structured unipotent holonomy family, and train the cell so that positive accumulated translation produces a controlled projective attractor. This creates a measurable two-basin long-horizon behavior: hidden-state perturbation directions should align with a learned direction X or its antipode according to the sign of a scalar functional, rather than exhibiting unconstrained rotation or…
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Partition a neural network into coupled parameter or activation blocks with distinct effective noise temperatures, and inject Gaussian perturbations whose covariance contains off-diagonal terms induced by the coupling. Unlike standard independent gradient noise, equal-temperature or detached blocks should have negligible cross-correlation, whereas unequal-temperature coupled blocks should exhibit measurable correlated fluctuations.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a reversible neural evolution from alternating learned drift and kick maps, then periodically apply the learned inverse sequence and penalize failure to reconstruct the original hidden state. The echo loss turns the paper's time-reversal protocol into a directly measurable stability certificate for long-depth neural dynamics and can identify whether errors are diffuse numerical noise or localized catastrophic faults.
Useful5/10
Difficulty5/10
Novelty3/10
Unverified
2026
Add a low-rank control perturbation to each optimizer block so that the next-step parameter dynamics compensate for growth of selected normalized perturbation directions. The control is computed by least squares from Jacobian-vector products, with a trust-region penalty limiting its stochastic cost; unlike isotropic weight decay, it targets directional instability while preserving directions that are already contracting.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace raw updates of strongly coupled parameter blocks by updates in rescaled, approximately normal-form coordinates. The optimizer estimates the local coupling matrix between block directions, solves a small modulation system for transformed velocities, and optionally subtracts predictable first-order cross-block drift.
Useful5/10
Difficulty5/10
Novelty4/10
Unverified
2026
Apply the paper's augmented cusp-map construction to an implicit neural layer or recurrent equilibrium, treating selected weights, gains, or input statistics as bifurcation parameters. The scanner detects parameter values where an equilibrium loses uniqueness through a fold or cusp, allowing the model to avoid unstable regions or deliberately exploit controlled multistability. Unlike merely monitoring exploding gradients, it provides a local certificate based on residual size, inverse-Jacobian…
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Initialize and train a linear recurrent or state-space transition using the stochastic Lyapunov operator rather than only constraining the drift matrix to be Hurwitz. Start from a controller that stabilizes the drift-only dynamics, then continuously increase the multiplicative-noise coefficient and update the controller while enforcing a positive-definite Lyapunov certificate. The resulting module should avoid exploding hidden states when process noise depends on the hidden state or input.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Equip a latent transition model with a near-identity polynomial coordinate transform that conjugates the nonlinear transition to a linear latent operator, at least locally around a reference state. Train the transform jointly with the dynamics using both the usual prediction loss and the paper's splitting/intertwining residual, so that multi-step prediction is performed partly in approximately linearised coordinates.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent or state-space transition with a complex-orthogonal flow generated by a skew-transpose matrix. The transition preserves a bilinear quadratic quantity exactly, preventing repeated application across long sequences from causing norm explosion or decay in the linear dynamics.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an unconstrained residual block by a four-field feature dynamics containing a primary feature T, flux-like auxiliary features J, curl-cleaning features psi, and a scalar cleaning feature phi. Couple these fields with learned skew-adjoint spatial operators so that the reversible block preserves the squared feature norm, while a separately controlled relaxation term can remove high-frequency or constraint-violating components. Use an exact Cayley update rather than explicit Euler to…
Useful5/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace part of a sequence or spatiotemporal model's unconstrained recurrence with a bank of stable second-order filters whose poles are a frequency-shifted precession pole and a diffusion pole. The chemical-potential parameter produces oscillatory memory, while the diffusion parameter produces scale-dependent decay; a learned residual branch preserves expressivity when the prior is imperfect.
Useful5/10
Difficulty5/10
Novelty5/10