✗ Mechanism failed
2026
Replace or augment a deterministic recurrent hidden state with a stochastic Markov transition, then explicitly measure its entropy production and output memory time. Penalize operating points where the target changes faster than the hidden state can track at the available dissipation, while allowing the model to satisfy the bound either by increasing transition activity or by developing a longer-lived memory mode.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a conventional recurrent hidden state with a phase oscillator state whose stored memories are exponentially stable phase-locked configurations. Each memory has a coupling matrix or low-rank coupling parameter, while an external context selects which coupling landscape is active; this separates representation storage from sequence routing.
Useful8/10
Difficulty6/10
Novelty7/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 a high-dimensional recurrent state with an autoencoder whose latent code evolves under a learned linear state transition and is corrected by a differentiable Kalman filter. Jointly optimizing reconstruction and filtering losses should produce latent coordinates that preserve uncertainty-relevant directions, even when they are not the directions with the smallest ordinary autoencoder reconstruction error.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Add a non-autoregressive continuation layer to an RNN, SSM, or world model that predicts a future trajectory by solving for coefficients of a library of past trajectory windows and reusing those coefficients on the corresponding future windows. Unlike nearest-neighbor retrieval, the coefficients interpolate across multiple behaviors and can generalize to unseen systems whose output-visible eigenvalues are represented in the library.
Useful8/10
Difficulty5/10
Novelty6/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
✗ Failed on benchmark
2026
Replace a conventional linear decoder in an autoencoder or latent state-space model with an explicit quadratic manifold decoder, allowing a small latent vector to represent curved and transport-like state trajectories. Add a dynamics-aware invariance loss that penalizes the discrepancy between the time derivative of the quadratic manifold and the neural dynamics evaluated on that manifold.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observability margin to choose which delay taps to retain under a fixed memory or computation budget. Add a candidate delay only when it substantially increases the smallest singular value of the delay map, converting the paper's large-delay asymptotic result into an adaptive receptive-field construction for sequence models.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Split a recurrent or state-space model into a coarse quotient state \(z_t\) and a leaf or fibre state \(y_t\), where the quotient evolves autonomously and the fibre is driven conditionally by the quotient. Constrain the two transition operators to have independently measurable contraction or correlation rates, then allocate capacity and regularization to the slower branch. This is intended for sequence tasks containing both slowly evolving global variables and rapidly mixing local variables.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace or augment a recurrent hidden coordinate with a nonnegative bistable autocatalytic state driven by an external control signal. The cell retains information through metastable low and high states, while a periodic or slowly varying control produces a controlled phase lag and hysteresis useful for temporal regime detection. Explicit noise can be injected to test whether it enhances switching near the predicted intermediate-frequency regime.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a slow routing state and an intermediate hysteresis variable between a neural memory and its next-state selector. The hysteresis prevents small prediction fluctuations from repeatedly changing the active attractor, while the slower router learns transition probabilities independently of the attractor parameters.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's stable periodic orbits and border-collision transitions as an intentional memory mechanism in a recurrent module. Different input-dependent parameter settings can place the same cell in fixed-point, period-2, or higher-period regimes, allowing a compact state to encode discrete modes without allocating one separate neural attractor per mode.
Useful7/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace the generic nonlinear drift in a two-dimensional continuous-time recurrent cell by a learnable piecewise-linear Lienard restoring force. Fold breakpoints and jump breakpoints become explicit architectural controls for creating multiple oscillatory attractors, allowing hidden states to encode phase, mode, or periodic memory. Weak input coupling can select or perturb attractors while preserving the autonomous cycle structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use paired recurrent channels with exactly reciprocal gains while applying a common phase rotation. One channel carries a controlled expanding mode and the other a matching contracting mode, creating a tunable hyperbolic memory spectrum without the optimization fragility of an unconstrained recurrent matrix.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace an unconstrained recurrent transition with block-diagonal planar rotations whose angles are learned or conditioned on a slowly varying context variable. The resulting hidden-state norm and each two-dimensional block energy are exactly invariant in the ideal recurrence, preventing exploding or vanishing recurrent dynamics while retaining phase information over long horizons.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Construct a recurrent module with a phase variable and a transverse memory coordinate modeled on a perturbed twist map. Train the transverse state to lie on an invariant graph over the phase, while the phase follows an approximately irrational rigid rotation. A KAM-inspired graph correction and residual penalty should reduce long-horizon drift in recurrent prediction.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a generic recurrent update by a positive-state continuous-time cell whose interactions are restricted to a quadratic zero-one reaction-network motif with three state variables and six reactions. Select a motif known to possess three positive equilibria, then use the two stable equilibria as binary memory states and the intervening unstable equilibrium as the separatrix. This creates an explicitly multistable RNN module with a bounded attractor count and a measurable stability…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Attach a small dynamical observer to a neural ODE, RNN, or state-space model and make it estimate only a task-relevant functional of the hidden state, such as logits, value features, or control-relevant projections. Use an incremental quadratic constraint and a bounded-real penalty to make the observer robust to hidden-state nonlinearities and input disturbances, instead of reconstructing the full latent state.
Useful6/10
Difficulty6/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
Replace an unrestricted GRU or attention-based history encoder with a fixed companion-form shift register driven by the current action and observation, followed by a learned nonlinear policy. The register stores a structured finite history, while a learned matrix or MLP readout maps that history to a control-relevant latent state. This should provide a cheaper and more interpretable memory mechanism for partially observed environments, especially when the relevant dynamics are approximately…
Useful5/10
Difficulty4/10
Novelty6/10