✗ Mechanism failed
2026
Run an adaptive neural ODE solver once to determine accepted step sizes, then train using a regular fixed-length replay of those steps rather than differentiating through adaptive accept/reject logic. The replay can be fused across a batch of trajectories and differentiated with an ordinary reverse sweep, giving the exact discrete gradient of the replayed solver and predictable GPU work.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build each one-step operator as a maximum over a compact set of learned or discretized action branches, with a branch-dependent penalty. This directly imports the envelope structure used for nonlinear semigroups and gives a neural architecture suited to HJB equations, robust prediction, and stochastic control under model uncertainty.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed momentum and learning-rate schedule with a batch-aware stability controller derived from the paper's critical-learning-rate scalings. Polyak learning rates should scale approximately with B(1-rho), whereas Nesterov learning rates can scale as B^beta(1-rho) until reaching the base stability ceiling; this may allow larger batches without crossing the instability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a purely memoryless optimizer step by a partially observed feedback controller for parameters evolving under colored, active gradient fluctuations. Estimate the hidden persistent component of the gradient from parameter displacement and observed minibatch gradients, then use that estimate to cancel predictable activity or adapt the effective update target without directly observing the latent disturbance.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat neural-network parameters as the state of a controlled dynamical system and optimize a short sequence of parameter updates instead of committing immediately to the next optimizer step. A cheap guiding optimizer, such as Adam or SGD, is rolled out to produce a moving terminal center; the lookahead optimizer is penalized or constrained when its endpoint leaves a neighborhood of that center. This transfers the paper's policy-relative feasibility and performance idea without requiring a…
Useful7/10
Difficulty7/10
Novelty7/10
✗ Mechanism failed
2026
Use an online estimate of the loss barrier separating the current basin from candidate neighboring basins to tune optimizer noise or a trust-region radius. The paper predicts that the current- or power-maximizing barrier is nonzero and approximately matched to an effective harmonic-mean temperature, U_0^* approximately equal to T_act, providing a concrete schedule for increasing or decreasing exploration.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Add a bounded probing perturbation to the inputs or intermediate outputs of a neural sensor-fusion model, and choose the perturbation by maximizing separation between the predicted trusted-output set and output sets induced by candidate sensor attacks. Bounded feature and measurement uncertainty are propagated through local neural Jacobians as zonotopes, giving a conservative, geometry-based exposure objective rather than relying on random noise. Training can use the resulting margin as a…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use the adapted linear latent model as a cheap receding-horizon planner or training-time controller around a nonlinear neural predictor. Optimize a short sequence of latent corrections with a quadratic objective, while constraining latent states and inputs to remain inside the region where the Koopman approximation has been identified and its transition spectrum is stable.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Add a fading-memory consensus force to parameter dynamics, pulling the current parameter toward a distributed average of its past while preserving the ordinary gradient step. Implement the infinite memory through one or several recursive exponential states, and tune the memory decay so that quadratic-mode dynamics remain exponentially stable. This should suppress oscillations and catastrophic steps without relying on conventional momentum alone.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Attach two independent critics to a learned controller: an empirical probability that executing the controller reaches a desired terminal set, and a recoverability value estimating whether the current state remains inside a safe reach-avoid region. Execute the learned controller only when both critics pass their thresholds; otherwise route to a conservative fallback policy or expert.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use several phase-locked states as distinct attractors of one recurrent network and shape their basin asymmetry through the phase-delay composite spectrum. This creates a controllable associative-memory architecture in which a desired memory receives a larger basin without adding a separate classifier or explicit nearest-neighbor lookup.
Useful7/10
Difficulty7/10
Novelty8/10
✗ Mechanism failed
2026
Add an uncertainty-aware observation scheduler to a neural state-space model or recurrent world model. Between expensive observation-encoder updates, propagate the latent state using the learned dynamics; periodically compute a decimated Riccati prediction and choose the largest skip length whose predicted covariance remains below a task-specific bound. This replaces a fixed observation stride with a principled, state-dynamics-dependent schedule.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace an unconstrained continuous-depth neural update with a constrained implicit Runge–Kutta step whose internal stages and final state are required to remain in a convex feasible set. For box-constrained latent states, this prevents exploding or negative states while retaining the high-order structure of Radau or Gauss integration and avoiding the order-destroying behavior of post-step clipping.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Train a recurrent neural network or state-space model using a Poincare-style event loss: identify two consecutive latent alignment events and require the latent position and velocity at the second event to equal a transformed version of the first. Evaluate the Jacobian of this return map and penalize unstable non-neutral Floquet multipliers, producing long-horizon trajectories that are both periodic or symmetry-periodic and locally stable.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Treat a momentum optimizer or recurrent state update as a damped oscillatory feedback system whose local closed-loop dynamics have a cubic characteristic polynomial. Estimate local damping, oscillation frequency, and feedback gain, then cap the learning-rate or momentum gain using the cubic Routh-Hurwitz inequality so that oscillatory divergence is prevented before it appears in the loss.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use explicitly stochastic latent dynamics to detect hidden-state changes that are invisible in the observed output spectrum. Near the integral-memory regime, constrain or monitor cross diffusion with a forward-versus-reverse path statistic, preventing output-equivalent latent models from developing physically implausible irreversible dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a fixed gradient-clipping threshold or fixed optimizer trust region by a dynamic envelope that expands when proposed parameter updates are repeatedly clipped, contracts after clipping disappears, and tightens further during sustained unsaturated convergence. This transfers the paper's bidirectional modification mechanism to training while retaining an explicit safety cap on the actual parameter update.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Replace the raw HJB residual loss of a neural PDE solver with a parametrix-preconditioned fixed-point target. At each local space-time patch, analytically propagate terminal values and source terms through a Gaussian kernel whose covariance uses a frozen diffusion matrix, while asking the network to learn only the variable-coefficient correction. This should reduce the burden on the network to represent stiff high-frequency diffusion dynamics and improve short-horizon convergence.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Partition a network's parameters into M ordered blocks and represent blockwise normalized update activity by a nonnegative density n_i. Instead of assigning independent learning rates, evolve this density through a discrete conservative current whose diffusivity depends on local activity, while adding calibrated multiplicative noise from the corresponding mobility. This couples learning-rate adaptation across depth or layer order and prevents isolated blocks from becoming arbitrarily overactive.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a fixed PAGE refresh schedule with a restart policy selected from the PL condition-number regime. For well-conditioned objectives, use frequent full-gradient refreshes and short inner phases; for ill-conditioned objectives, use the conventional condition-number-scaled PAGE phase length. The goal is lower component-gradient cost to a target loss while retaining PAGE's low-variance updates.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Use a spectral eigenvalue-counting function to bracket each target mode before neural optimization. The network then solves only within an interval containing exactly one eigenfrequency, preventing optimization from repeatedly collapsing to the lowest mode or jumping between modes.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Add a resonance-estimation module to a recurrent network or state-space model and regularize the decay spectrum of its observable correlations. Instead of using eigenvalues of a small projected recurrent matrix as memory timescales, estimate dominant poles from multi-step correlations and a resolvent/Krylov fit, thereby remaining valid when projection eigenvalues are ill-conditioned or hidden resonances occur. The method is intended to preserve useful long memory while suppressing unstable or…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Treat a recurrent or state-space network as a locally linear dynamical system and select a small set of hidden-state or module coordinates that have unusually high leverage on a target output through a dominant unstable or weakly damped eigenmode. Use the ranking both for red-team targeted perturbations and for defense: penalize, prune, or damp selected coordinates so that target amplification is reduced without uniformly shrinking all recurrent dynamics.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an instantaneous largest-eigenvalue learning-rate ceiling with a delayed-instability monitor for a slowly ramped optimizer or network gain. When a dominant complex eigenpair crosses from negative to positive real part, permit a controlled post-crossing interval, but stop or roll back when the accumulated positive growth budget exceeds the perturbation/noise margin. This exploits slow-passage delay without allowing unbounded training instability.
Useful7/10
Difficulty6/10
Novelty7/10