✗ Failed on benchmark
2026
Augment a neural state-space model or neural ODE with a low-dimensional control residual that keeps its hidden state inside a sequence of time-varying convex sets encoding temporal requirements. At each integration step, solve a small quadratic program that minimally changes the network dynamics while enforcing an inward-pointing condition on every active convex-set face, producing robustly constrained long-horizon rollouts.
Useful8/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use a consensus-coupled optimizer for replicated model parameters, but construct every communication perturbation so that the all-ones consensus direction remains in the Laplacian null space. This prevents topology noise, pruning, or heterogeneous communication weights from changing the common parameter trajectory while still allowing disagreement modes to be damped.
Useful8/10
Difficulty5/10
Novelty6/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
Use an online estimate of the positive feedback gain among logits, routing probabilities, and representations to adjust the softmax temperature. Increase temperature when the estimated cyclic gain approaches the instability regime, preventing exponential amplification and router collapse without globally weakening all layers.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the observation Jacobian to remove from a neural latent dynamics model the component of its drift that is locally inconsistent with the observed manifold. Apply this projected drift only to generate particle proposals, and retain exact importance-ratio correction so that proposal projection improves particle coverage without changing the target posterior.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a complete tensor/Kronecker polynomial lift of a graph dynamical system with observables selected only from the support of the interaction graph. The lifted state can then be propagated by a sparse structured linear operator, while the first omitted degree is treated as an explicit residual or learned closure. This gives a graph-aware polynomial state-space layer for neural ODEs, graph RNNs, and world models.
Useful8/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Build a recurrent layer whose feedback is explicitly filtered through a trainable distributed-delay kernel rather than an unconstrained one-step recurrence. At each update, use the local characteristic equation induced by the feedback gain and kernel Laplace transform to reject parameter settings with right-half-plane roots or to maintain a prescribed stability margin.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed optimizer preconditioner with a diagonal matrix selected by an online convex optimizer. A gradient predictor supplies the direction, while a linear-loss regret update learns coordinate-wise gains that favor transformations aligned with the realized stochastic gradient. The method retains the identity preconditioner as an explicit comparator, so it can be tested for negative regret and improvement over ordinary SGD.
Useful8/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained recurrent hidden-state update by a fast redistribution state with a dissipative Jacobian and a slow conserved state. The network computes an equilibrium state and a first-order pseudoinverse response correction, transferring the paper’s separation between local relaxation and macroscopic transport into a stable recurrent or state-space layer.
Useful8/10
Difficulty7/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 failed
2026
Replace an unconstrained recurrent update or neural-ODE vector field with a nominal learned control plus an explicit high-order barrier correction. The correction enforces hidden-state safety even when the control affects the safety variable only after several time derivatives. A quadratic-program projection preserves the nominal network output whenever the learned dynamics already satisfy the barrier inequality.
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
✗ Failed on benchmark
2026
Replace an EKF or a large particle ensemble inside a neural world model with a fixed-order polynomial chaos representation of the latent state distribution. The transition network is evaluated under quadrature or sampled chaos variables, and Galerkin projection produces the next uncertainty coefficients directly; a coefficient-wise LMMSE update then assimilates observations without backpropagating through resampling.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a neural policy with a control-barrier safety layer whose constraints use an online estimate of model mismatch or environmental disturbance. Instead of enforcing a fixed worst-case bound at every state, the layer reconstructs the current effective dynamics from an extended state observer and adds only the margin required by the remaining estimation error.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition by a randomly switched composition of disk-preserving Blaschke maps. The recurrent state remains in the unit disk, while the estimated average logarithmic derivative provides a direct synchronization-versus-chaos control knob: negative transverse growth should make two states driven by the same input or map sequence synchronize, whereas positive growth should preserve sensitivity and expressive memory.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a single value critic with graph-indexed critics V_alpha and graph-indexed policy heads pi_A, where the labeled graph covers every possible environment mode at every step. Train sampled Bellman inequalities rather than only equality-based temporal-difference errors, and select the policy head using the paper's min-max reachability rule. This targets robust RL settings in which the transition mode can change arbitrarily, such as unknown actuator regimes, domain randomization modes, or…
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
△ Mechanism confirmed, baseline not beaten
2026
Replace layer-local reconstruction in post-training quantization with a sequential objective that explicitly cancels the error already accumulated by the quantized prefix. For each layer, quantize its weights so that its local residual approximately negates the propagated incoming deviation, preserving the teacher trajectory even when the codebook is binary or 4-bit.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Estimate the local contraction rate along minibatch couplings of neural ODE or flow-matching trajectories instead of using one global Lipschitz lower bound. Use the resulting displacement-weighted rate to trigger adaptive solver tolerances, training-time regularization, or early stopping when the transported distributions have entered a strongly contracting region.
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
For a neural ODE, residual flow, or deep equilibrium model with a dominant polynomial component, compute the directional dynamics induced by its highest-degree homogeneous term on the unit sphere. Penalize or reject parameter regions containing radially growing attracting directions, preventing finite-time activation blow-up while preserving nonlinear dynamics in safe directions.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a standard recurrent update with a two-state absolute-value cell whose local dynamics are exactly piecewise affine. Train the coupling parameters while enforcing discrete-time Schur inequalities inside each activation quadrant, preventing exploding recurrent trajectories while retaining nonsmooth gating and richer dynamics than a globally contractive linear cell.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use a neural network to predict only constitutive exchange coefficients, while a fixed skew-symmetric operator generates the conservative part of the update and a structured thermodynamic operator generates the irreversible source. The resulting layer preserves a chosen energy exactly in continuous time and can enforce nonnegative entropy production through a constrained parameterization of exchange rates.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace a dissipative optimizer update with a canonical discrete flow on the extended state $(\theta,p,t,e)$, where $\theta$ are network parameters, $p$ is momentum, $t$ is training time, and $e$ is its conjugate energy variable. Use a symmetric composition of exact Hamiltonian subflows for kinetic energy, loss, and time translation; this preserves the extended symplectic form and avoids artificial phase-volume collapse. Weak restarts or occasional damping can be added separately if convergence…
Useful8/10
Difficulty5/10
Novelty6/10