△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent or neural-ODE vector field with a Lie-algebra-valued connection depending on time, input position, and an auxiliary spectral parameter. Train the model both for prediction and for approximate zero curvature, so evolution along different discretized paths is compatible rather than accumulating arbitrary noncommutative drift.
Useful7/10
Difficulty6/10
Novelty7/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
✗ Failed on benchmark
2026
Attach a sampling-based rollout correction head to a neural policy or learned world model, and adapt its temperature and number of rollouts so that approximation error stays within the contraction margin of a nominal policy. The controller should spend samples only when the local state-dependent error gain is close to violating the small-gain condition, instead of using a fixed MPPI sample count everywhere.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Build a recurrent or state-space layer whose transition matrix depends on a scalar pooled from the current hidden state. Estimate the local derivative of the scalar closure and penalize feedback gains that approach the fold threshold, preventing abrupt branch changes and excessive sensitivity.
Useful7/10
Difficulty5/10
Novelty7/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
Build a sequence or graph module whose state is a canonical set of affine tropical pieces rather than an opaque hidden vector. Compose consecutive segments by Minkowski addition of their lifted supports, merge alternatives by union followed by lower-hull reduction, and evaluate the resulting piecewise-linear function with a minimum.
Useful7/10
Difficulty7/10
Novelty8/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
Unverified
2026
Add a bank of temporal branches whose synapses apply heterogeneous delays before coincidence pooling. A branch selectively responds to an ordered pair or short sequence when the delay difference compensates the sequence interval, while low delay dispersion makes it primarily an order-invariant event detector. The branch threshold creates sparse, interpretable activations that can replace part of a recurrent or attention-based temporal module.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a Sylvester equation as an implicit parameterization of a recurrent or state-space transition matrix, while regularizing the actual solution X rather than only the coefficient matrices A and B. The key mechanism is to suppress small singular values of X and near-resonant eigenvalue pairs, which otherwise amplify selected components of the learned transition.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's multiplicative spectral law to initialize a recurrent or state-space transition matrix as a deterministic operator multiplied by a unitarily invariant random factor, then choose the factor scale so the predicted complex eigenvalue support lies near a target stability annulus. This directly targets long-horizon gradient preservation instead of relying only on singular-value normalization.
Useful6/10
Difficulty6/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
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
Build a recurrent or state-space layer with fixed, spatially heterogeneous relaxation rates and measure its steady response to positive versus negative input offsets. Unlike a homogeneous linear state-space model, an individual heterogeneous realization can generate a controlled even response, allowing directional transport, asymmetric temporal context, or hysteresis-like sequence transformations without inserting an explicit quadratic input feature.
Useful6/10
Difficulty6/10
Novelty7/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
Train a recurrent or state-space world model as a semiconjugate factorization: the high-dimensional state dynamics \(G\) must project through an encoder \(E\) to a lower-dimensional latent map \(F\), satisfying \(E\circ G\approx F\circ E\). Add a connected-fiber regularizer so states with the same latent code form geometrically coherent sets, allowing the model to discard redundant microscopic motion without discarding the entropy-carrying macroscopic dynamics.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach a small, online-adapted Taylor-polynomial residual model to a neural dynamics model instead of adapting all network weights. Construct the dictionary from the local Taylor structure, remove monomials forbidden by known joint-odd symmetry, and update its coefficients with recursive least squares. This yields fast adaptation with an interpretable parameter count and a direct test of whether the assumed symmetry is valid.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an untied stack of recurrent or polynomial-filter blocks with a delayed recurrence whose coefficients repeat with period r and whose characteristic polynomial has exact (r+1)-fold rotational symmetry. The resulting layer couples the current state to a state r steps back, producing a structured spectrum rather than arbitrary eigenvalues and potentially improving long-horizon propagation with fewer parameters.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add an explicit memory field to a recurrent or state-space model and make the memory feedback act through a discrete biharmonic operator, producing the paper’s characteristic \(z=4\) long-wavelength relaxation. This should preserve slowly varying sequence structure while damping high-frequency hidden-state noise, potentially improving long-horizon prediction without requiring a very large recurrent state.
Useful6/10
Difficulty5/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
Replace an unrestricted recurrent state with a current input-driven state coupled to a fading average of its own history. The memory coupling provides a distributed dissipative channel, while the recurrent Jacobian is constrained below a measurable contraction boundary. This creates a recurrent or state-space block whose long-horizon sensitivity can be tested against explicit characteristic roots.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Useful6/10
Difficulty5/10
Novelty8/10