✗ Failed on benchmark
2026
Replace repeated time-stepping of a stiff linear state-space block with a quadrature approximation to its inverse Laplace transform. The layer propagates a hidden state using a small set of complex shifted linear solves, which can be batched and reused across many time steps or parameter values.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Constrain each member of a wide recurrent or neural-ODE population to use the same time-dependent vector field whose spatial components generate a finite-dimensional Lie algebra. Store m fundamental trajectories and one fixed invariant label per node, then reconstruct every node state with the Lie-Scheffers superposition map instead of integrating all n states independently. The resulting layer has an exact md-dimensional dynamical core and should preserve the full network trajectory up to…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Use the switched nonlinear extension to distinguish stability of the linearized modes from stability of the full neural dynamics. Stabilize worst-case linear products and limit the variation of each nonlinear Jacobian inside a specified radius, yielding an explicit local basin estimate and a penalty that prevents mode interactions from destroying attraction.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Add a learnable cyclic-coordinate mechanism to latent dynamics so that selected latent coordinates do not enter the Hamiltonian and their conjugate momenta become conserved. This provides an explicit dimensionality-discovery and invariance bias, encouraging the model to represent nuisance or symmetry directions compactly instead of spending independent dynamics capacity on them.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Reparameterize a recurrent or state-space layer so that its hidden-state update contains an explicit stabilizing feedback controller, while the neural network learns only a residual control in the feedback coordinates. Choose K to reduce finite-horizon state-propagation amplification, suppressing exploding hidden states and gradients on long sequences.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent matrix by a structured asymmetric circulant coupling whose Fourier modes have analytically known complex eigenvalues. A selected nonzero mode becomes a rotating attractor, providing a phase-coded recurrent state that can preserve information through oscillatory dynamics without requiring the optimizer to discover a stable spectral structure from scratch. A weak input projection and optional mode-selection loss can use the attractor as a nonlinear memory…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Treat recurrent or state-space network blocks as measured dynamical components and analyze their closed-loop interaction through frequency-domain gain, without requiring exact internal state-space equations. Estimate each block's local transfer matrix from perturbation-response experiments, assemble the block interconnection, and regularize training whenever the interaction approaches a small-gain or singularity boundary.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained latent transition in an SSM or recurrent block by quiver data (alpha,gamma), where alpha evolves the latent state and gamma injects token or feature inputs. Add a differentiable penalty that detects eigenmodes of alpha not reached from gamma, preventing dead latent directions and improving long-context signal propagation. The paper’s exact open condition becomes a practical regularizer rather than a hard architectural constraint.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Initialize a recurrent or state-space transition matrix with weak Wigner noise plus a shared cumulative-sum correlation structure. Increasing the correlation strength produces recurrent eigenmodes one at a time at analytically predicted BBP thresholds, yielding a controllable hierarchy of short- and long-memory modes. The matrix should then be globally rescaled or constrained so that all active modes remain inside the desired stability radius.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition or latent neural-ODE vector field with a port-Hamiltonian transition. The layer separates conservative mixing from dissipative contraction, guaranteeing non-increasing latent storage energy when the external input is zero and bounding energy growth under driven inputs.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's finite-dimensional second-moment equations to compute the stationary covariance induced by a Markov-switched recurrent layer before training, then whiten or scale each mode's hidden state using that covariance. This can prevent mode-specific saturation and eliminate a long burn-in period in long-context RNNs and state-space models.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat the sequence of recurrent or state-space Jacobians along a trajectory as a noncommutative matrix cocycle, analogous to the time-dependent offspring mean matrices in the branching model. Estimate its finite-horizon growth exponent and use it to adapt spectral normalization or recurrent gain, targeting a slightly negative exponent for stable memory without uncontrolled exploding dynamics.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the usual averaged Jacobian test for a periodically modulated neural update with a finite harmonic-transfer model that explicitly couples perturbation frequencies separated by the modulation frequency. Use the resulting lifted spectral radius to cap the learning rate or reduce modulation amplitude when sideband interactions create an instability that is invisible in the averaged model.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace interpolation of heterogeneous sensor streams by a phase-indexed recurrent or state-space network with period M, where M is the least common multiple of the sensor sampling periods. The network applies a distinct transition for each phase while using a fixed cyclic phase update, preserving timing structure and allowing missing observations to enter only when their phase-specific sensor is available.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent transition with a hierarchy of features whose generator is triangular: degree-ell features depend only on degree-ell and lower-degree features. This transfers the paper's closure mechanism for even-Majorana monomials into a neural state-space model, preserving nonlinear feature interactions while making the spectrum and long-time transients directly controllable.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace the unconstrained transition of a recurrent or state-space neural network with a DMDc-initialized linear latent transition plus a learned nonlinear residual. Estimate the transition from a short warm-up dataset using Hankel delay coordinates, retain eigenmodes with decay rates near the unit circle for long-term memory, and let the neural residual model dynamics not explained by the linear backbone. This should make long-horizon prediction and slowly varying signals easier to learn while…
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Train an encoder and decoder whose latent observables evolve through one shared linear Koopman matrix, while directly penalizing the empirical invariance residual of the learned observable subspace. This discourages latent coordinates that fit one-step transitions but continually leave the representational subspace, improving long-horizon rollout stability.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's finite-width O(n^{-1/2}) Gaussian-process approximation bound as a width-budgeting rule rather than choosing every hidden dimension uniformly. Estimate an architecture-specific constant for each layer or attention contraction, then allocate width according to the smallest dimension satisfying its allowed distributional error. This should produce narrower models at comparable GP-like behavior, or permit the same parameter budget to be concentrated in the layers where finite-width…
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use the differentiable covariance chart to construct a Fisher-information preconditioner for the edge and innovation parameters of a linear-Gaussian neural module. Instead of applying an isotropic Euclidean update, whiten parameter steps according to how strongly they change the predicted Gaussian distribution. This targets ill-conditioning caused by redundant paths, correlated latent nodes, and badly scaled innovation covariances.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Replace an unconstrained input-dependent multiplier on a recurrent fast-weight state with a sign-preserving tanh gate. The new state retains an additive low-rank update and optionally a separately modulated innovation term, but the accumulated-memory branch can never be amplified by a factor whose magnitude exceeds one.
Useful7/10
Difficulty4/10
Novelty5/10
✓ Mechanism works
2026
Replace orthogonal Procrustes alignment between two latent dynamical systems with a learned bijection h that makes their transitions commute: h(f(z)) approximately equals g(h(z)). Parameterize h as an invertible affine map or coupling flow, allowing the correspondence to be non-orthogonal while retaining an exact inverse. The same constraint can be applied over multiple rollout steps, encouraging two models to represent the same computation even when their latent coordinates differ…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Regularize a recurrent or state-space model using finite-time Lyapunov exponents of its actual hidden-state transition products. Penalize collapsed adjacent exponents while also controlling the largest exponent, encouraging several useful state directions instead of one dominant direction or universal contraction.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Replace an explicit Euler residual update for a skew-coupled hidden state with a five-stage palindromic composition of exact shear maps. Use a=1/4, the unique real coefficient maximizing the analyzed spectral CFL interval, and adapt the step size from an estimate of the learned coupling operator's spectral norm.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace a directed sequence-memory chain with a circular recurrent state propagated by a learned delayed convolution. The same learned kernel can support forward and reverse replay because replay direction is a dynamical mode of the ring, rather than requiring plasticity to explicitly learn both forward and backward synapses.
Useful7/10
Difficulty5/10
Novelty8/10