✗ Failed on benchmark
2026
Replace a neural sequence model's unconstrained multi-step latent rollout with a data-driven LPV predictor acting on a learned latent state. Build the predictor from Hankel matrices of past latent observations, inputs, and scheduling features, then use an LQ factorization to project the large data coefficient matrix into a fixed-dimensional coordinate system. The model preserves scheduling-conditioned dynamics while making rollout cost independent of the number of training trajectories.
Useful7/10
Difficulty6/10
Novelty6/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
✓✓ Beats tuned baseline
2026
Augment a recurrent or state-space neural model with two predictors: an absolute predictor using raw command and output histories, and an incremental predictor using differences. Use the absolute prediction residual, projected onto an offline-learned mismatch subspace, to estimate persistent actuator bias or dead-zone effects and compensate the next command or latent transition. The incremental branch provides a diagnostic because a constant mismatch should vanish there while the absolute…
Useful7/10
Difficulty5/10
Novelty8/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
△ Mechanism confirmed, baseline not beaten
2026
Train a recurrent policy or neural controller so that histories with the same observation are forced toward the same intervention decision, while simultaneously requiring that the shared decision covers all unsafe latent transitions. This is stronger than ordinary action imitation or latent-state consistency because the loss explicitly penalizes cases where two observationally indistinguishable histories demand incompatible safety actions.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a recurrent or state-space neural network in a sampled-data feedback loop: latent states evolve continuously or at every fine solver step, while a constrained optimizer updates the control, adapter, or residual-gating vector only every M steps. Between optimizer updates, use zero-order hold or linear interpolation and reject updates that violate a learned Lyapunov decrease condition. This should prevent large transient latent explosions caused by aggressive optimizer updates while…
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
✓✓ 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
Add a learned phase coordinate to an RNN, state-space model, or latent neural ODE and train it to advance at constant angular velocity along recurrent trajectories. This separates genuine phase progression from amplitude and embedding distortions, encouraging coherent long-horizon oscillations while providing a quantitative monitor for impending loss of a limit cycle.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Turn a path-complete graph into a stability regularizer for a recurrent or state-space neural network whose update can switch among M learned operators. Maintain a neural quadratic or positive scalar certificate V_alpha for each graph node and penalize every graph edge that violates contraction under its corresponding operator. The resulting architecture is designed to remain stable even when the mode sequence is arbitrary rather than generated by a trained gate.
Useful7/10
Difficulty6/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
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
✗ Failed on benchmark
2026
Use the reachability verifier as an optimization controller: permit a neural controller update only when the proposed parameter step remains inside a certified STL-safe trust region, and shrink the region when the reachable robustness margin collapses. This turns verification from an expensive final check into feedback that prevents gradient descent from crossing a temporal-logic feasibility boundary.
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace the recurrent transition by a dissipative linear state update minus a maximal monotone nonlinear damping operator. Couple the hidden-state update to an output map so that the cell satisfies a discrete analogue of the paper's scattering-passivity inequality, controlling both hidden-state energy and output energy by initial-state energy plus input energy.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Replace an unconstrained second-order residual or state-space block with a position-velocity system whose damping is the gradient or subgradient of a convex function. Compute the next state implicitly, so the damping cannot inject energy and the resulting layer is robust to large learned damping nonlinearities, nonsmooth activations, and long rollouts.
Useful7/10
Difficulty5/10
Novelty5/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
✓✓ 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
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
Use the determinant and trace-power identities of the rules matrix as a spectral diagnostic for recurrent or state-space training. Penalize unstable or excessively resonant modes through a truncated log-zeta objective, while retaining selected eigenvalues near the unit circle when long memory is desired. This gives a falsifiable transition criterion based on closed-walk growth rather than only gradient norms.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Apply the paper's empirical preimage-entropy construction to a learned recurrent transition map, penalizing excessive distinguishable hidden-state histories that produce the same current state while preserving multiple histories when the task requires genuine multimodality. Unlike a raw inverse-Jacobian penalty, the regularizer is computed only among inverse trajectories having similar empirical state distributions, so it distinguishes useful multimodal memory from uncontrolled branch explosion.
Useful6/10
Difficulty7/10
Novelty9/10
Unverified
2026
Use two bounded self-adjoint transition operators in a recurrent or state-space block and penalize their normalized Hilbert--Schmidt commutator. When the penalty is small, the paper guarantees that the pair is close to exactly commuting operators, suggesting a controlled path to a shared eigenbasis and cheaper coordinate-wise dynamics. Add an optional numerical repair step that projects the learned pair toward a simultaneously diagonalizable pair.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a generative or recurrent neural architecture with several contractive or mildly expanding branches, and explicitly control the geometric complexity of its invariant set using the sub-additive singular-value pressure of branch-Jacobian products. Instead of regularizing only the operator norm, the model can preserve anisotropic directions while targeting a desired attractor dimension, potentially improving coverage of structured data without uncontrolled folding or collapse.
Useful6/10
Difficulty6/10
Novelty8/10