Unverified
2026
Treat a two-player neural game as a stochastic monotone operator problem and add an anchor regularizer that makes the current game strongly monotone during early training. Use stochastic extragradient steps inside geometrically decreasing regularization stages, retaining the accumulated anchor rather than resetting it; this should suppress rotational GAN dynamics while avoiding a permanent bias toward the initialization.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
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.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Represent a small ensemble of parameter vectors or a low-dimensional projection of parameters as a periodically driven probability distribution, and optimize the learning-rate/control waveform so that the distribution translates through successive optimization phases at approximately constant speed without unnecessary reshaping. The method adds a dissipation penalty based on probability-current mismatch and uses automatic differentiation through the particle or density dynamics to learn a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a single residual feature field with two nonnegative streams: a primary representation A and a mutant or corrective representation B. A produces B through a one-way source term, while B suppresses A, creating an explicitly tunable competition mechanism that can prevent feature collapse and encourage complementary representations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add calibrated multiplicative noise to a binary energy-based model, Hopfield network, or discrete recurrent attractor system so that its effective coupling follows a chosen distance from the collective critical point. Unlike ordinary temperature annealing, the controller distinguishes microscopic channel noise from Gibbs or sampling noise and predicts when ordered attractors should disappear through a measurable susceptibility peak.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Treat the correlation decay exponent and Hermite rank as explicit hyperparameters controlling the roughness of the depth-wise residual trajectory. Use smoother long-memory drivers for stable deep propagation and less correlated drivers when optimization needs more layer-wise diversity, while retaining critical scaling so the network does not collapse to the identity.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
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.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace unconstrained momentum updates for selected neural-network parameter blocks by damped second-order motion on a unit sphere. The update learns directions while preserving the block norm exactly, and includes the centripetal term required for a valid acceleration constrained to the sphere rather than merely projecting gradients after an unconstrained step.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
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.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
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.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's parallel-branch response structure as a measurable regularizer on training dynamics. Penalize large high-frequency gain and excessively slow relaxation modes, encouraging parameter updates whose loss response is smooth, damped, and composed of controlled time scales rather than a sharp unstable mode.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Split the optimizer state into a passive descent sector and an explicitly nonequilibrium current-like sector, then constrain the local update Jacobian to be block triangular. The active sector may perturb the passive update, but passive perturbations cannot feed back into the active sector at first order, making its decay rate measurable and preventing uncontrolled oscillatory feedback. A second design objective tunes the two decay rates to reproduce the paper's slow-mode splitting and uses the…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace ordinary dropout or soft sparsity penalties on a nonnegative spatial or token activation field with sublinear multiplicative stochastic dynamics. The field receives local diffusion or graph smoothing, while noise amplitude u^gamma vanishes at zero but is relatively strong near zero; this creates an absorbing zero state and may produce exact contiguous inactive regions. The module is suitable for feature maps, graph-node fields, token routing scores, or continuous neural operators.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the discrepancy between a learned potential and its long-time backward Lax–Oleinik evolution to identify dynamically critical states. Persistent near-contact points are candidates for the Aubry set and can guide adaptive collocation, while states with large gaps can receive fewer training samples.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
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.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Run an ensemble of noisy optimization trajectories and regard trajectories that return to the same loss basin as competing dynamical phases. Estimate a complex return generating function from their path costs; a near-zero of this function signals cancellation between trajectory families and predicts an abrupt change in basin occupancy. Use the signal to reduce learning rate or optimizer noise near a transition, or increase noise when one phase dominates too early.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
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.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Apply the paper's empirical preimage-entropy construction to a learned recurrent transition map, penalizing excessive distinguishable hidden-state histories that produce the same current state while preserving multiple histories when the task requires genuine multimodality. Unlike a raw inverse-Jacobian penalty, the regularizer is computed only among inverse trajectories having similar empirical state distributions, so it distinguishes useful multimodal memory from uncontrolled branch explosion.
Useful6/10
Difficulty7/10
Novelty9/10
Unverified
2026
Treat the empirical hidden-state distribution of a recurrent or state-space model as a Wasserstein-space state and estimate the linearized pushforward operator on perturbation vector fields. Penalize tangent modes whose estimated transfer gains exceed one, while retaining near-unit fixed modes that represent robust invariant distributional structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained residual block by a first-order gradient-flow correction whose energy contains first-, second-, and third-difference penalties, mirroring the paper's higher-gradient gravitational energy. The correction suppresses high-frequency modes while retaining a trainable nonlinear residual branch, and its step size can be chosen from an explicit spectral stability bound.
Useful6/10
Difficulty5/10
Novelty6/10
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
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