✗ Failed on benchmark
2026
Replace derivative-based latent-dynamics fitting with an integral regression and maintain a history stack selected by the smallest eigenvalue of its information matrix. The model should perform aggressive parameter updates only when the estimated latent regressors are sufficiently exciting, while a perturbation bound prevents false excitation caused by inaccurate hidden-state estimates.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Split a learned transition model into a contractive nominal branch and a high-capacity excursion branch, and blend them using calibrated epistemic uncertainty. The nominal branch is used exclusively in the well-supported region, while the excursion branch is activated when the current latent state leaves that region, preventing flexible model errors from being recursively amplified during ordinary rollouts.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace uniformly spaced history taps in a neural state-space encoder with a fixed or learned set of non-uniform delays. Regularize the resulting delay-observation matrix to have a large smallest singular value, which makes latent-state reconstruction less sensitive to irregular timestamps and observation noise. This is directly applicable to event-based data, missing timestamps, and systems with multiple time scales.
Useful8/10
Difficulty6/10
Novelty7/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
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
✗ 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
✗ 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
✗ Failed on benchmark
2026
Combine a learned dynamics model or neural policy with a short-horizon robust MPC wrapper. Instead of tightening every future constraint by one stationary worst-case radius, propagate uncertainty using the actual neural closed-loop Jacobians and explicitly fall back when the tightened optimization problem is infeasible, making envelope violations observable rather than silently unsafe.
Useful7/10
Difficulty7/10
Novelty8/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