✗ Failed on benchmark
2026
Learn a low-dimensional Koopman operator from successive states of an iterative neural system, such as debate agents, recurrent refinement blocks, or diffusion denoising trajectories. Use the magnitude of the subdominant eigenvalue to predict the remaining number of rounds required for disagreement to fall below a target tolerance, and stop computation when the predicted deadline is reached rather than using a fixed round budget.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a deterministic recurrent transition by an iid-random family of transitions and explicitly control the spectrum of the corresponding annealed Koopman operator. Nontrivial eigenvalues inside the unit disk give a measurable exponential memory-decay envelope, while complex eigenvalues provide stable oscillatory memory modes useful for long-horizon sequence prediction.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace per-eigenvector spectral supervision on symmetry-forced multiplets by a projector-trace target determined from the operator family's commutant. Use individual eigenvalue or eigenvector targets only outside detected forced blocks, avoiding arbitrary basis choices and exploding gradients at protected crossings.
Useful8/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace a point hidden state in a recurrent or state-space neural network with a zonotope representing all latent states consistent with bounded process and observation errors. Propagate the zonotope through the learned dynamics and intersect it with the set implied by the next observation, producing a corrected uncertainty tube rather than an unconstrained open-loop hidden trajectory. This should improve long-horizon prediction under distribution shift and expose a sharp failure boundary when…
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition with a decaying symmetric memory operator plus a skew-symmetric rotational operator. The skew component creates phase-shifted cross-channel memory and can represent oscillatory or circulatory temporal dependencies without requiring eigenvalues with large positive real parts.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a continuous spatial trunk and a pole-constrained modal state-space branch into a spatiotemporal predictor. The model represents a field as a sum of learned spatial modes and exponentially evolving modal coordinates, so long-horizon behavior is controlled by explicit poles rather than by an unconstrained recurrent transition matrix.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a sensitivity-aware stability monitor and regularizer to an RNN, neural state-space model, or linearized sequence model. Instead of evaluating the model at many perturbed inputs or parameter settings, estimate how each perturbation changes the dominant eigenvalues of the local hidden-state Jacobian, then penalize perturbations predicted to push eigenvalues toward the unit circle. This should improve long-horizon behavior while identifying a quantitative perturbation radius at which…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a slow sequence of resolvent or contractive fixed-point updates by a blockwise averaged-reflection extrapolation. The method computes reflected iterates R^j y_0, averages them with equal weights, and uses the result as the next macro-iterate. Unlike unconstrained Anderson acceleration, this construction has a uniform residual guarantee for every maximal monotone operator.
Useful8/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained deep RoPE attention residual update by a spherical or norm-preserving update whose attention kernel has a known positive floor. Estimate the reversible transverse spectrum of the current attention matrix and choose the residual step size below its explicit Euler stability limit; use the angular token diameter as a runtime contraction monitor.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace repeatedly applied unconstrained message passing or recurrent transition maps with a transport layer containing a coherent hopping branch and an explicit dephasing operator. Small dephasing preserves sharp, oscillatory propagation, whereas large dephasing suppresses inter-position correlations and produces stable diffusion-like receptive-field growth, which should reduce long-horizon ringing and exploding sensitivities.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Replace each recurrent neural state with two asymmetrically coupled variables: a slow state x_i and a fast momentum or drive variable v_i. Each coordinate or block updates independently using its locally available, possibly stale input; the auxiliary variable supplies inertia that suppresses harmful update-order sensitivity and can accelerate traversal toward a retrieved state or denoised solution.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use a consensus-coupled optimizer for replicated model parameters, but construct every communication perturbation so that the all-ones consensus direction remains in the Laplacian null space. This prevents topology noise, pruning, or heterogeneous communication weights from changing the common parameter trajectory while still allowing disagreement modes to be damped.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use an online estimate of the positive feedback gain among logits, routing probabilities, and representations to adjust the softmax temperature. Increase temperature when the estimated cyclic gain approaches the instability regime, preventing exponential amplification and router collapse without globally weakening all layers.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Insert an online errors-in-variables subspace estimator into a latent state-space neural network. A fixed recent window of encoder features and controls is used to estimate a noise-corrected low-dimensional state subspace and refit the latent transition and readout matrices, allowing the model to follow sensor degradation or changing operating conditions without replaying the entire dataset.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unconstrained linear recurrent or state-space memory with a finite-history recurrence whose coefficients are nonnegative and sum to one. The resulting companion transition is nonnegative and row-stochastic, guaranteeing spectral radius at most one while retaining a neutral constant-history mode at eigenvalue 1.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the uniform or power-law convolution in a recurrent or state-space layer by a Gaussian q-binomial fractional kernel with learnable order alpha and deformation q. The parameter q controls a concrete memory-localization transition: q close to 1 gives classical fractional power-law memory, whereas q<1 produces exponentially localized memory and should reduce long-horizon gradient interference and truncation cost.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace recurrence or nearest-neighbour analogue lookup with a learned delay-coordinate observer that continuously corrects a latent state using the current observation. Constrain the observer's closed-loop Jacobian or linear state matrix to have spectral radius below one, so prediction error contracts geometrically and required burn-in grows logarithmically with target accuracy.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace uniform collocation for a fixed random-feature neural PDE solver with sampling from the leverage-score density of the operator-applied features. Whiten the retained residual feature space before solving for output coefficients, so the sampled least-squares matrix has an identity-like expected Gram rather than inheriting severe anisotropy from the differential operator. The same construction can be used for a linearized neural network by treating Jacobian features as the trial functions.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Model a residual network, recurrent update, or optimizer as a switched linearized system in which each layer type, token, data batch, or optimizer regime selects a matrix mode. Constrain the worst-case product growth over admissible switches, rather than merely constraining every individual Jacobian, so arbitrary mode sequences remain contractive.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat one optimizer update as a stochastic dynamical map and estimate its local contraction margin from recent parameter-update or gradient residuals. Reduce the usable margin, and therefore the learning rate or trust-region radius, by a Wasserstein/heavy-tail penalty based on online excess kurtosis so distribution shifts cause graceful step-size shrinkage rather than sudden divergence.
Useful8/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a neural feedback law together with explicit well-posedness barriers, then certify the resulting closed loop using a common quadratic Lyapunov and activation-sector certificate. The controller is deployed only if the certificate proves exponential decay or a discounted quadratic-cost bound, converting training into a falsifiable stability-constrained synthesis procedure.
Useful8/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained high-dimensional recurrent hidden state with a low-dimensional nonlinear invariant manifold attached to a selected spectral subspace of the hidden-state linearization. Learn both the manifold graph and its reduced nonlinear dynamics, then roll out the reduced coordinates for long horizons while reconstructing the full hidden state only when needed.
Useful8/10
Difficulty6/10
Novelty7/10