Physics-informed losses, stability guarantees, Koopman and Floquet operators, attractor conditioning — on forecasting and control tasks.
Use midpoint or running ergodic averages of adversarial iterates for evaluation and checkpointing instead of exposing a single phase-dependent iterate. The mathematical attenuation factor suppresses rotational error, especially for modes with large step-size-times-frequency product.
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.
Model a finite training run as a driven stochastic process whose control parameter is the learning rate or another scheduled hyperparameter. Compare the distribution of parameter perturbations, activations, logits, or losses after a finite-rate update to a reference distribution generated by a much slower approximately adiabatic schedule; reduce the learning rate when the estimated relative entropy exceeds a calibrated threshold.
Replace a conventional leaky recurrent update with a population of stochastic membrane potentials that evolve only while subthreshold, emit an event at threshold, undergo a delayed reset, and receive feedback from a filtered population firing rate. Add a shared noise source alongside independent neuron noise to regularize the layer while preserving coordinated population-level dynamics.
Augment neural-network parameters with momentum variables and update the pair using a symplectic map generated by a Hamiltonian. The optimizer approximately preserves a modified Hamiltonian, reducing systematic energy drift and potentially making long unrolled optimization more stable.
Modify learning-rate or annealing schedules so that local improvement is not mistaken for convergence when different parameter blocks occupy incompatible global modes. Measure a local-consistency score and a global-coherence score separately; slow training whenever local consistency is high but global coherence remains low, allowing competing parameter domains to merge before cooling further.
Replace the usual explicit residual update with a nonstandard general-linear block containing several internal feature stages. The effective step is a positive denominator function rather than the raw depth step, allowing the block to take large nominal steps while damping the update and preserving bounded activations. This is most promising for deep residual MLPs, neural ODE discretizations, and state-space sequence models where exploding hidden states limit usable depth.
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.
Build a recurrent or continuous-depth block from a dissipative vector field and project every state derivative onto the tangent cone of a closed convex hidden-state set. Unlike ordinary clipping, tangent-cone projection removes only the outward component at the boundary and preserves admissible motion. Under the paper's maximal-dissipativity result, the continuous flow is nonexpansive in its initial state.
Replace a fixed optimizer learning-rate field by a positive state-dependent scaling rho(theta) and penalize expansion of weighted parameter-space volume. The optimizer is encouraged to contract regions of parameter initializations that have high weighted divergence, potentially reducing sensitivity to initialization and stabilizing training near sharp or anisotropic loss landscapes.
Track an exponentially discounted approximation to the current min-max saddle gap and use it to control the optimizer of a GAN or adversarial learner. If the recent gap rises, reduce both players' step sizes and clear stale momentum; if it falls consistently, cautiously increase the step sizes. Unlike ordinary loss EMAs, this signal measures whether each player is close to a recent best response and can detect equilibrium-tracking failure even when generator and discriminator losses look benign.
Augment a latent neural ODE with learned constraint functions whose time derivatives are forced to close linearly on the constraint family, making the zero level set invariant by construction. Integrate only the quotient-relevant coordinates while treating the constraint-generated characteristic coordinates as gauge variables, reducing latent dimension and suppressing long-horizon constraint drift.
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.
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.
Replace an unconstrained latent transition by a layer with a distinguished scalar coordinate \(t\) and a symplectic leaf state \(x=(q,p)\). The layer advances \(t\) through a Reeb drift while updating \(x\) with a symplectic Hamiltonian step, preventing arbitrary mixing between progression and content coordinates and potentially improving long-horizon stability.
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.
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…
Treat a coupled neural training loop as a delayed feedback system with two hard delays and two first-order implementation filters. Estimate the dominant coupled Jacobian mode and use the characteristic equation to distinguish a recoverable delay-induced oscillation from a filter-induced instability; then reduce stale-gradient delay only in the former case, and slow or retune EMA or relaxation filters in the latter.
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.
Augment a recurrent or state-space layer with a finite-order causal Volterra compensator that models and cancels dominant nonlinear feedback around a stable linear transition. Use quadratic terms by default and add cubic terms only when the model must operate farther from equilibrium, making truncation order an explicit compute and robustness control.
Wrap a learned residual policy or neural world-model controller around a stabilizing LQR feedback law, and permit sampling-based action refinement only when its estimated Monte Carlo and temperature errors fit inside a Lyapunov perturbation budget. Increase the rollout sample count, reduce temperature, or fall back to the baseline LQR action when the budget is violated. The controller should therefore trade computation for a measurable reduction in unstable or unsafe rollouts.
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.
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.
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.