✗ Mechanism failed
2026
Train a recurrent or neural state-space model on fixed-initial-state subsequences, but select the training horizon and burn-in from an empirically estimated turnpike bound instead of choosing them arbitrarily. If the cumulative discrepancy between fixed-initial-state and free-initial-state optima is bounded, the average discrepancy decreases as 1/N, allowing shorter windows while preserving the long-horizon optimum.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Train or initialize a Lyapunov certificate for a recurrent, state-space, or neural-ODE model on an inner set, then actively discover a larger stable state envelope instead of assuming that the certificate generalizes out of distribution. A Gaussian process models the signed stability margin or binary long-horizon outcome, and new simulations are selected where posterior uncertainty and proximity to the estimated boundary are both high.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace ordinary modality-specific residual fusion with a switched observer whose latent correction depends on the currently available channel. The individual channels are allowed to be insufficient to reconstruct the latent state; stability is enforced over the full switching cycle, so complementary intermittent observations can jointly maintain a stable representation.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Augment a latent neural state-space model with an observable-coordinate residual that is first learned flexibly and then projected onto a constrained library of interpretable coupling terms. Train or collect data only after checking that the trajectory sufficiently excites the candidate terms; this prevents a latent model from fitting arbitrary hidden-state effects that are unidentifiable from the observations.
Useful8/10
Difficulty6/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
△ Mechanism confirmed, baseline not beaten
2026
Replace independent noisy evaluations in a stochastic fixed-point solver with a recursive estimator whose increment is a clipped oracle difference. For a contractive or nearly nonexpansive implicit layer, this should suppress heavy-tailed minibatch noise without clipping the fixed-point signal itself, producing more reliable residual decrease and fewer expensive oracle evaluations.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or state-space model with a base state carrying task-relevant dynamics and an explicitly contracting auxiliary state. If the training loss or energy depends on the auxiliary state, replace it by a quotient loss plus an analytically known telescoping correction; long-run optimization and invariant averages are then unchanged, while transient fiber effects decay geometrically.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Add an exact backward-conditioning module to a neural state-space model so trajectories satisfy a terminal label, target set, initial-state restriction, or prescribed event count without rejection. The module computes a backward feasibility message and reweights each neural transition toward states that can still satisfy the constraint, producing a conditioned process equivalent to a Doob transform. For large latent spaces, the exact message can be approximated by a value network and its…
Useful7/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Turn the latent substrate into a persistent computational workspace for sequential inputs: each new observation is written into a designated subspace, processed by the same local rule, decoded, and then selectively retained or reset. This creates a compact recurrent model whose state can accumulate algorithmic information across a stream without expanding the parameter count.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Expose a recurrent model to deliberately designed input pulses or latent-state perturbations instead of training only on passive trajectories. Choose perturbations that maximize the smallest eigenvalue of the accumulated feature Gramian, making otherwise indistinguishable recurrent couplings recoverable and reducing uncertainty in long-horizon predictions.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Train a recurrent or neural-ODE state transition with an integral residual instead of matching noisy finite-difference derivatives. Enforce sparse regulator-to-state connectivity with group sparsity, so the model learns a compact dynamical mechanism while avoiding the severe variance amplification caused by estimating derivatives from sampled data.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a small robust quadratic-program layer to a neural controller. The network proposes an action, and the QP returns the closest action satisfying an ISS Lyapunov decrease constraint and a robust safety-barrier constraint under bounded model disturbances. This should preserve the network's behavior away from constraint boundaries while preventing unstable or unsafe actions near those boundaries.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Represent a hybrid trajectory with one neural module per known dynamical phase rather than a single network spanning all phases. Feed the predicted terminal state of phase r directly as the initial state of phase r+1, so continuity is satisfied by construction instead of by a soft interface penalty. This should improve learning near abrupt changes and remove an otherwise poorly conditioned loss-weight tradeoff.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
When a neural state-space model has latent directions that are invisible under normal inputs, add a small structured carrier to the input or hidden-state update during selected training windows. The carrier changes local measurement and transition projections, analogous to the paper's carrier-dependent measurement and force projections, and can reveal modes that passive training leaves unconstrained.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add finite-horizon observability and reachability objectives to a recurrent or state-space neural model so that its latent modes are both inferable from outputs and influenceable by available inputs. This directly penalizes the failure mode identified in the paper: a large latent perturbation with nearly zero first-order output projection.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
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
✗ 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
Add a latent mode bank whose coordinates are learned by neural power iteration on observed state transitions rather than by jointly fitting an unconstrained latent dynamics model. Each mode is repeatedly regressed toward its one-step pushforward, normalized under the data distribution, and deflated against previously learned modes. The resulting latent coordinates are constrained to have approximately linear, diagonal dynamics, which should improve long-horizon prediction and make the…
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use Halpern iteration to solve a non-expansive neural equilibrium layer from temporally correlated samples, and estimate its stochastic operator with a PAGE-style refresh/difference estimator. The anchor supplies a vanishing but explicit stabilizing force, while same-state differences reuse consecutive Markov samples and should reduce the number of full oracle evaluations required for a target fixed-point residual.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace or augment a recurrent cell with multiple hysteresis memory branches whose states remain unchanged while the input stays within a branch-specific radius, then move toward the current input only when that radius is exceeded. The resulting cell has explicit persistence and bounded state changes, giving it an inductive bias for temporal hysteresis and reducing the need for the network to learn long-term memory behavior from scratch.
Useful6/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a model-free residual-dynamics observer to a neural multi-step forecaster. Instead of asking the network to relearn persistent periodic or autoregressive disturbances, maintain a Hankel dictionary of recent forecast errors and use ridge reconstruction to predict the next residual sequence online. Add the predicted residual to the network forecast with a confidence-dependent correction gain.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Prepend an adaptive Savitzky-Golay derivative bank to a temporal neural network. For each input channel and derivative order, select the local window by minimizing Stein's unbiased risk estimate, then concatenate the raw signal with the estimated derivatives. This supplies denoised velocity and acceleration features without requiring clean derivative targets or forcing the backbone to learn unstable finite-difference filters.
Useful5/10
Difficulty3/10
Novelty6/10