Unverified
2026
Replace a fixed or heuristic noise-annealing schedule with one constrained by the FPU freeze-out scaling. In stochastic gradient Langevin dynamics, reduce the injected temperature slowly enough that residual parameter fluctuations remain below a target floor; if cooling is too fast, the optimizer should retain a measurable nonequilibrium variance analogous to the FPU residual energy.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Constrain the transition matrix of an RNN or linear state-space model to the paper's class Cρ instead of controlling only its spectral radius or spectral norm. The resulting transition has an explicit dilation certificate and satisfies ∥T^n∥ ≤ ρ for every time horizon, preventing exploding hidden states while retaining nonnormal dynamics that ordinary spectral normalization may remove.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a regularizer to a recurrent or state-space transition that makes its expansion along a learned one-dimensional direction approximately constant across hidden states. A learned potential can absorb state-dependent terms, implementing the paper's cohomology mechanism rather than forcing the raw Jacobian to be constant.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add an entropy-Lyapunov consistency term to a recurrent or state-space model whose learned dynamics are intended to reproduce a chaotic invariant distribution. The regularizer targets the equality condition h_mu(f) = sum_i max(lambda_i, 0), while a dominated-splitting diagnostic determines whether the theorem assumptions are approximately plausible instead of blindly forcing equality.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the linear state transition in a small recurrent or state-space module by a circulant matrix acting on a vector over a finite field. The hidden state then has only finitely many possible values and follows an exactly periodic orbit after at most \(q^n\) states, eliminating numerical drift on modular-counting and symbolic-memory tasks. A learned real-valued encoder and decoder can surround the discrete core, while the transition itself is fixed, searched, or trained with a…
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace the memoryless parameter update with a discrete generalized Langevin update whose friction kernel is a positive mixture of decaying modes generated or scheduled by a Loewner driving process. Inject correlated gradient noise using the same kernel, implementing the paper's fluctuation-dissipation mechanism instead of choosing momentum and noise independently. The method is intended for noisy minibatch training, where controlled colored noise can preserve exploration while suppressing…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace or augment an RNN or state-space model hidden state with coordinates on a bounded 3-step nilpotent group. The first layer stores ordinary features, the second layer stores pairwise commutator memory, and the third layer stores nested commutators that can preserve three-time dependencies invisible to first- and second-order summaries. Layered reduction keeps the state bounded while retaining the algebraic interaction structure.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Treat consecutive optimizer updates as a discrete dynamical system and monitor the dominant local multiplier of the parameter-update map. When an estimated real multiplier approaches -1, apply damping or reduce the learning rate, because the paper's mechanism predicts the onset of an alternating period-2 orbit before ordinary divergence is visible.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense token-mixing matrix in a sequence model with a fixed or learnable SBP derivative operator D=P^{-1}Q. The discrete integration-by-parts identity makes the interior mixing energy-neutral or boundary-dissipative, reducing exploding activations in deep residual stacks while preserving directional information along the sequence.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Equip multiple recurrent agents with a shared spatial or token-level trail field whose influence is a bounded function of accumulated visitation, rather than an unbounded additive memory. Use the paper's simultaneous/sequential invariance as a falsifiable design target: parallel and randomly ordered asynchronous agent updates should produce nearly identical predictions when trail occupancy is saturated, while deliberately nonsaturating controls should show order dependence. This can enable…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace Langevin or random-walk sampling for a strongly log-concave neural subproblem with randomized Hamiltonian trajectories. Each iteration draws a fresh Gaussian velocity, integrates position and velocity for a random triangular or exponential duration, and discards the terminal velocity before the next refresh. The target is a regularized posterior over a convex neural-network head, where the paper's accelerated dependence on the strong-convexity parameter is applicable.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Split a recurrent or state-space model into a persistent slow state and a fast internal state. Every r recurrent steps, preserve the slow state but reset or contract the fast state toward a learned reference, reproducing selective restart rather than a destructive global reset. The expected benefit is suppression of long-range oscillatory and error correlations while retaining trajectory-level information.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Construct a Lanczos chain for the neural-network vector field or hidden-state evolution, separately within bins of approximately constant loss, energy, or activation norm. Use the resulting Krylov complexity and Lanczos-coefficient growth as an early-warning signal for unstable training or long-horizon hidden-state amplification, then reduce the learning rate or recurrent integration step only in the unstable shells.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use one or a few explicit Coulomb transport steps on generated particles as a differentiable or detached corrector, then train the generator to imitate the corrected particles. This separates global distribution matching from the generator parameterization and can reduce adversarial-gradient noise and mode collapse.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a positive completely monotone memory branch to an optimizer or recurrent state update, but retain an explicitly calibrated instantaneous gradient or input branch. Estimate the memory branch's finite-horizon coercivity and prevent the system from entering regimes where memory suppresses high-frequency corrections and causes slow or unstable training.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Train a square orthogonal neural mixer while maximizing its entrywise fourth-power concentration. When optimization reaches a non-permutation stationary configuration, explicitly test rank-two row or column rotations and take a rotation with positive exact second variation, using the paper's constructive saddle-escape mechanism.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use nested parameter-confidence sets to control how far a neural optimizer may move when its local loss dynamics are uncertain. Estimate a local linear model of parameter or gradient evolution, propagate a homothetic tube for possible next iterates, and impose a trust-region radius that shrinks when the estimated contraction margin is insufficient. This gives a model-based alternative to heuristic gradient clipping and predicts a sharp learning-rate boundary tied to the largest uncertain…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Insert a reference governor between a neural model's raw latent command and a linear state-space update, so that hidden states and outputs remain inside a prescribed union of polytopes. At every step, choose the largest interpolation toward the desired command whose predicted trajectory remains in the offline safe set. This can prevent hidden-state explosions and invalid latent trajectories without globally shrinking the model's weights.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a response-sensitive regularizer to networks whose outputs should react predictably to a control input, using the stationary Markov sensitivity equation as a certificate. Instead of only penalizing large neural gradients, the method attributes amplification to the generator resolvent and can distinguish amplification caused by a nearly slow latent mode from amplification caused by uncontrolled parameter growth.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Turn a sparse expert layer into a stochastic birth-death population. Each expert receives a bounded fitness score from recent routed-token performance; at each update, a candidate expert is activated with probability p, while one expert is removed with probability q = 1 - p, preferentially removing the lowest-fitness expert. The paper's critical threshold f_c = q/p predicts which fitness levels can maintain a growing surviving population, providing a principled control knob for expert turnover.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
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.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Model locally competing neural-network parameter basins as low-energy states with different effective multiplicities, and inject calibrated parameter noise to measure when the optimizer begins switching between them. Use the resulting pseudo-transition peak as a principled trigger for changing learning rate, noise, or regularization rather than relying on a fixed epoch schedule.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's explicitly solved SU(2)-based extremal flow as a structured recurrent transition instead of learning an unconstrained dense recurrent matrix. The transition has only two scalar parameters, a radius/frequency r and phase phi, while its rotating coefficient pattern continuously mixes four real state coordinates and can be integrated with a norm-preserving Cayley transform.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Represent a rational-like feature transformation with an auxiliary state y constrained by polynomial equations G(x,y)=0, and update x and y jointly along the tangent space of that constraint manifold. This creates residual blocks in which nonlinear feature identities remain consistent over many layers or time steps, reducing auxiliary-variable drift and potentially stabilizing rational activations and implicit recurrent dynamics.
Useful6/10
Difficulty5/10
Novelty8/10