✗ Failed on benchmark
2026
Replace an unconstrained graph-message-passing block with a port-Hamiltonian layer whose edge interactions are generated by a skew-symmetric formation-matrix coupling and whose node damping is positive semidefinite. The layer can model relative graph structure while preventing unforced hidden-state energy growth, reducing exploding activations and oversmoothing caused by arbitrary repeated propagation.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a fixed optimizer memory order with a nested family of gradient-integral controllers. Training begins with a first-order update and activates additional accumulated-gradient states only after an exponentially smoothed residual fails to decrease for several decision intervals; newly activated gains are ramped from zero, so the parameter update remains continuous and previously learned states are preserved. The optimizer should use little memory on easy problems and acquire longer memory…
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace selected residual, recurrent, or state-space blocks by modules whose input-output Jacobians satisfy an IODP inequality throughout a prescribed activation domain. The constraint controls incremental amplification between two trajectories without requiring either trajectory to remain near one fixed equilibrium, so it should improve robustness to changing contexts and prevent exploding long-horizon sensitivities.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Add an observability objective to an RNN so that a finite trajectory of selected hidden coordinates preserves information about the initial hidden state. The regularizer maximizes the smallest singular value or log determinant of the finite-horizon observation Jacobian, counteracting ReLU activation masks that erase hidden-state directions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the local Jacobian of a looped transformer to estimate its remaining relaxation time and stop the recurrent computation when the predicted residual reduction is sufficient. Near a saddle-node fold, the paper's asymptotic relation converts an estimated dominant eigenvalue into a compute forecast, allowing dynamic iteration budgets instead of a conservative fixed maximum.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Model one period of a cyclic optimizer or periodically modulated recurrent network as a discrete-time linear time-periodic system obtained by linearizing the update around its current trajectory. Estimate a periodic Lyapunov matrix sequence and scale the next learning-rate or modulation amplitude so that every phase contracts according to a certified energy decrease. This should prevent delayed divergence caused by resonance with the schedule, even when individual phase Jacobians are…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Treat a neural-network training update as a control input and impose control-barrier inequalities on quantities that must remain safe, such as parameter norm, activation variance, attention-logit magnitude, or an estimated Lipschitz margin. At each step, solve a small quadratic program that stays as close as possible to the nominal gradient update while guaranteeing a first-order forward-invariance condition.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Wrap a learned neural controller or world-model policy with a quadratic-program projection that enforces a robust higher-order control barrier condition. The projection uses a neural estimate of hidden state variables and a certified bound on model and estimator residuals, so the nominal policy is changed only when it approaches a learned safety boundary.
Useful8/10
Difficulty5/10
Novelty5/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
✗ Failed on benchmark
2026
Train a neural vector field together with a positive-definite metric \(M_\phi(x,u)\) that certifies local contraction at a prescribed rate. The contraction penalty must include the total derivative of the input-dependent metric, so rapidly changing controls are treated as a source of geometry variation rather than incorrectly claiming stability from a frozen metric.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace an unverified fixed-point solve in a deep equilibrium or recurrent layer by an interval branch-and-bound procedure that certifies whether the equilibrium is absent, unique, or potentially multiple over a box of states and uncertain parameters. During inference, return the certified equilibrium when uniqueness is proved and reject, subdivide, or invoke a fallback solver when the certificate fails.
Useful8/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Learn a low-dimensional Koopman operator from successive states of an iterative neural system, such as debate agents, recurrent refinement blocks, or diffusion denoising trajectories. Use the magnitude of the subdominant eigenvalue to predict the remaining number of rounds required for disagreement to fall below a target tolerance, and stop computation when the predicted deadline is reached rather than using a fixed round budget.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an instantaneous diagonal optimizer with a causal convolution of recent gradients, where cross-layer or cross-module gradient correlations define a finite-memory Onsager response matrix. Estimate the response at several parameter-block pairs and lags, integrate it to obtain a finite-time transport matrix, and use its regularized inverse or symmetric part to precondition the update. This targets optimization regimes in which gradients propagate between blocks with measurable delay, such…
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace nominal optimizer stability checks based only on the Hessian or Jacobian with a robust covariance tube that includes minibatch noise, Jacobian variation, and nonlinear Taylor remainders. The learning rate is accepted only when the predicted parameter covariance and domain-exit probability remain below prescribed limits, yielding a principled trust-region scheduler for nonlinear optimization dynamics.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Constrain the Jacobian of a neural ODE or recurrent transition so that its second additive compound is Metzler and irreducible, then regularize the resulting finite-window wedge transition toward strict positivity. This should contract projective distances between admissible tangent 2-planes, causing perturbation planes to align and making long-horizon representations effectively two-dimensional rather than allowing uncontrolled orientation growth.
Useful8/10
Difficulty7/10
Novelty8/10
✗ Failed on benchmark
2026
Replace noisy pointwise derivative matching in a neural state-space model with a weak-form Koopman-generator residual. An encoder maps observations to latent observables, while a learned matrix generator propagates those observables. Integration by parts removes the need to differentiate noisy trajectories and provides a controllable noise-averaging mechanism.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace pointwise spectral-norm contraction in a recurrent or state-space model with an average logarithmic contraction certificate for an input-conditioned fibre update. Let a base state carry expressive, possibly noncontractive dynamics, while an auxiliary latent fibre contracts on average. This should preserve useful variability in the base while preventing long-horizon fibre explosion and making the fibre converge to an input-dependent invariant section.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent or neural-ODE state update with a copy of the known or learned plant dynamics plus a neural output-error correction, and train both the correction and a contraction metric using a pointwise matrix inequality penalty. The resulting observer should forget initialization exponentially and should amplify measurement noise by a quantitatively bounded factor rather than exhibiting unconstrained recurrent error growth.
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
✗ 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
Model a multi-timescale optimizer as a controlled dynamical system and use several Lyapunov-like quantities to regulate loss, momentum energy, and constraint violation simultaneously. The explicit high-order control-Lyapunov feedback becomes a low-cost correction to an SGD-momentum or Adam step. A Hurwitz comparison matrix supplies a measurable stability certificate and predicts the decay rate of the controlled training dynamics.
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Treat neural modules as interconnected dynamical subsystems and estimate the gain from every module input to every neighboring module output. Replace an expensive global Jacobian spectral-radius calculation by decentralized directed-cycle tests inside clusters and path-gain tests between clusters. Penalizing violations during training should prevent exploding recurrent trajectories while retaining less conservative behavior than constraining every individual block independently.
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 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