✗ Failed on benchmark
2026
Train a neural state-space model using all replayed transitions, but assign larger weights to samples near the current operating context rather than discarding distant samples. Add a strictly positive weight floor so local adaptation cannot eliminate global coverage or make the regression problem rank-deficient. This should improve prediction across nonlinear regimes while retaining the numerical robustness of full-data training.
Useful7/10
Difficulty4/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
✗ Failed on benchmark
2026
Build a recurrent or state-space layer whose transition matrix depends on a scalar pooled from the current hidden state. Estimate the local derivative of the scalar closure and penalize feedback gains that approach the fold threshold, preventing abrupt branch changes and excessive sensitivity.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Propagate uncertain inputs or parameter perturbations through a neural network with zonotopes, and choose the reduction rule after each layer using short lookahead that predicts downstream certified-bound error. Candidate reducers can include largest-generator retention, box conversion, and norm-based merging; unlike a fixed policy, the chosen rule depends on the current generator geometry and remaining network depth. The goal is tighter robustness bounds at the same generator budget, or the…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a recurrent or state-space model with latent coordinates split into tangent variables that carry the modeled dynamics and transverse variables that contract toward a learned invariant manifold. Penalize violations of invariance and enforce a spectral gap between tangent and transverse Jacobian dynamics, preserving useful noncontracting behavior while suppressing off-manifold drift during long rollouts.
Useful6/10
Difficulty6/10
Novelty7/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 paper's parallel-branch response structure as a measurable regularizer on training dynamics. Penalize large high-frequency gain and excessively slow relaxation modes, encouraging parameter updates whose loss response is smooth, damped, and composed of controlled time scales rather than a sharp unstable mode.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct a graph-based latent state whose velocities evolve through free-flight updates and pairwise elastic collision operators. Each collision operator is orthogonal, so total latent kinetic energy is exactly conserved; a connected interaction graph is intended to eliminate unwanted component-wise polynomial invariants and improve long-horizon stability.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace ordinary parameter updates for a constrained neural network with an annealed reciprocal-manifold flow. Each differentiable inequality constraint remains strictly satisfied during the optimization trajectory, avoiding projection or a per-step quadratic program. This is most useful for safety-critical policy learning, bounded network outputs, parameter-budget constraints, or training with explicit robustness inequalities.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a neural state-space model with an explicit first-order input-to-output path instead of forcing every output to depend only on deeply propagated hidden states. Penalize or reject learned linearizations whose transfer matrix has relative degree greater than one, then train a storage-function certificate for the remaining passive dynamics. This preserves the paper's relative-degree compatibility condition while allowing high-order internal memory.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build actuator or parameter constraints directly into the neural controller using a differentiable hard-saturation map rather than penalizing violations after the fact. This makes the Lyapunov certificate apply to the actual bounded controller and prevents training from exploiting unrealistically large actions.
Useful6/10
Difficulty3/10
Novelty4/10
Unverified
2026
Build a recurrent or state-space network with time-dependent transition parameters, but train it to forget perturbations at a common exponential rate across all admissible parameter schedules. The model should retain task-relevant long-term signals while suppressing dependence on arbitrary initial hidden states, reducing instability under changing inputs, curricula, or deployment-time dynamics.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the assumption that strong convexity keeps optimization inside a valid parameter chart with an explicit viability condition on the chart boundary. For Lie-group neural-network parameters or bounded latent coordinates, modify each update so its velocity has nonpositive outward radial component, using either a radial barrier or projection onto the tangent cone.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace constant friction and optimizer noise with a velocity-dependent friction gamma(u) and noise amplitude tied by a fluctuation-dissipation relation. High-speed momentum states can be damped and randomized differently from low-speed states, creating controlled transient exploration while preserving a known equilibrium momentum distribution.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a slowly varying block of neural-network parameters as a coarse-grained stochastic process and continuously estimate both its covariance spectrum and its linear response to small artificial perturbations. Use the fluctuation–response mismatch as a feedback signal to tune injected parameter noise or minibatch size; the thermal Einstein relation is imposed only when a calibrated equilibrium-like regime is desired, while antisymmetric response components are retained as admissible…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
For a learned control-affine latent dynamics model, replace the ordinary reciprocal barrier 1/h₀(z) with B(z) = s(z)/h₀(z), where h₀ is the physical safety margin and s is positive but depends on a velocity-like quantity whose derivative is directly affected by the action. This preserves the singularity at h₀ = 0 while giving the policy or safety projection layer first-order action authority over the barrier derivative.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a stable linear latent state-space block whose controllability Gramian is trained toward a chosen positive-definite target using squared Bures–Wasserstein distance. Direction-specific semidefinite constraints can suppress disturbance amplification in nuisance coordinates while preserving controllability in coordinates needed for prediction.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use a window of observed neural-network update trajectories to identify the set of local quadratic objectives and preconditioners that are consistent with the observed optimizer behavior. Rather than selecting one arbitrary curvature model, retain the nullspace of compatible parameters and use its dimension or smallest singular value as an identifiability and stability diagnostic.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Attach a finite mixture of zonotopes to each uncertain neural input or hidden state, and propagate every mixture component through affine layers and conservative nonlinear relaxations. When the number of components grows, merge components only with an enclosing zonotope and sum their probability masses, preserving a formal lower bound on the probability that the true activation lies in the represented set.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Augment a neural-network update with an auxiliary, damped stochastic branch that acts like the paper's floating dissipative reservoir. A trainable mixing phase \(\phi\) combines the task-gradient branch and auxiliary branch; \(\phi\) is adapted to make the auxiliary response to a chosen control perturbation nearly zero while retaining a finite task-gradient response. The intended benefit is selective insensitivity to nuisance hyperparameters or perturbations, with a measurable response peak…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace unconstrained or entropy-regularized MoE routing with a minimally disruptive update that preserves a lower bound on the log-determinant of the experts' weighted output span. The router still tracks the desired mixture, but a projection prevents the active experts from becoming linearly redundant or collapsing onto a low-rank subset.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Treat a selected neural submodule as an open dynamical system embedded in the rest of the network. Regularize it to contain internal modes that are simultaneously reachable from many external features and observable through many external outputs, rather than behaving as a one-sided receiver, broadcaster, or disconnected read/write split.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use adaptive performance specifications to prevent a neural controller or policy from demanding output changes that exceed bounded actuator amplitude or action-rate limits. The target error envelope tightens when the policy has control authority and relaxes when saturation or rate clipping persists, instead of allowing the controller to destabilize while chasing an infeasible target. This converts actuator clipping into an explicit slow state that can be used by reinforcement-learning policies…
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace fixed-path robustness testing with a coupled continuation procedure that increases an adverse perturbation while simultaneously optimizing a bounded corrective response, such as feature-gating, normalization, or a small adapter. Define the model's margin as the cumulative perturbation at which its equilibrium, prediction, or input-output Jacobian becomes singular or exceeds a prescribed gain threshold; train the corrective response to enlarge this margin subject to an explicit cost.
Useful6/10
Difficulty7/10
Novelty7/10