✗ 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
Add a controllable delay to the gradient force during optimization so that parameters follow a delayed-gradient dynamical system. Choose the delay below the stability boundary for ordinary training, and temporarily cross the boundary when the optimizer is trapped in a sharp or stagnant basin, causing stochastic fluctuations to be amplified out of the basin rather than waiting for a rare Arrhenius escape.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Introduce an effective learning-rate, gain, or regularization parameter that follows the commanded target with a finite implementation rate, and compensate for its predictable threshold-crossing lag. The scheduler estimates the network's current spectral instability boundary and commands the target parameter to cross that boundary early enough that the effective parameter crosses it at the desired time, avoiding overshoot caused by optimizer or hardware smoothing.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Distill the expensive inner minimization over state-estimation errors into a neural correction term that predicts the robust barrier drift, then fine-tune the correction using differentiable closed-loop rollouts. This retains the robustness mechanism while reducing the repeated optimization cost and allowing less conservative behavior than fixed analytic uncertainty bounds.
Useful8/10
Difficulty6/10
Novelty8/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
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 periodic all-reduce in federated or distributed training with local broadcasts triggered by a prescribed parameter-disagreement envelope. Each worker maintains held copies of the latest parameters received from neighbors and applies a consensus correction to its local optimizer update. After an asynchronous reception causes a discontinuous change in sampled disagreement, a receiver-side exponentially decaying correction temporarily enlarges the allowable envelope, preventing false…
Useful8/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace each recurrent neural state with two asymmetrically coupled variables: a slow state x_i and a fast momentum or drive variable v_i. Each coordinate or block updates independently using its locally available, possibly stale input; the auxiliary variable supplies inertia that suppresses harmful update-order sensitivity and can accelerate traversal toward a retrieved state or denoised solution.
Useful8/10
Difficulty5/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
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
✗ Failed on benchmark
2026
For a recurrent or graph neural network with known local connectivity, estimate each node's local Jacobian row using only graph neighbors rather than all hidden coordinates. Use the resulting sparse Jacobian both to compute a contraction certificate and to regularize training toward dynamically local interactions, reducing estimator variance and the number of samples required for reliable stability decisions.
Useful8/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Compress each hidden layer by retaining directions that are simultaneously reachable from the observed input distribution and observable at the network output. Unlike PCA or SVD, the retained subspace is weighted by downstream task sensitivity, so high-variance but output-irrelevant directions can be removed while low-variance predictive directions are preserved.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Augment a flow-matching or diffusion sampler with a dual variable for each equality constraint and integrate the sample and dual variables as one coupled ODE. The learned generative velocity is corrected in the constraint-normal direction using the transpose Jacobian of the constraint, while the dual state accumulates residual violations; this replaces per-step projection or nonlinear optimization.
Useful8/10
Difficulty5/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
✗ 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
✗ Failed on benchmark
2026
Wrap stochastic optimization or iterative neural inference in a controller that measures how far the state distribution moves during each interval and compares this motion with the available noise-dependent entropy-production budget. The controller increases the learning rate or reduces inference steps only while the trajectory remains inside the predicted speed-limit region, preventing fast jumps that cause accuracy collapse.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Partition neural-network parameters into competing blocks, such as LoRA adapters, mixture-of-experts heads, or task-specific heads, and update each block by minimizing its local quadratic model while holding the other blocks fixed. Use the exact Jacobi coupling spectral radius to decide whether simultaneous updates are stable; near the boundary, apply damping or fall back to sequential Gauss-Seidel updates.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
For a neural network with a trainable linear head or low-rank adapter, store feature vectors from recent minibatches and select a finite set that is sufficiently independent. Apply Modified Gram-Schmidt to obtain orthonormalized memory directions, then add residual corrections along these directions so the local parameter-error dynamics have an identity coefficient matrix rather than a poorly conditioned empirical Gramian. The method predicts a sharp transition after the buffer first contains…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Use the trajectory martingale decomposition to separate predictable training updates from genuinely unpredictable residual updates, then scale the residual according to its estimated response to future loss. The method targets stochastic or event-driven optimization with history-dependent samples and predicts that response-weighted residual energy, rather than total gradient variance, controls update noise and instability.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Treat a neural hidden-state process as a finite or discretized continuous-time Markov chain and define a target event as first entry into a target state set. Instead of estimating the derivative of the mean hitting time by expensive long rollouts, build an auxiliary regenerative chain that resets to the source state after reaching the target and estimate the same response from its stationary distribution. Penalize disagreement between this response prediction and short empirical perturbation…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Represent training near a switching condition as two locally smooth optimizer modes, such as low- and high-momentum updates or two preconditioners, with a delayed gate. Estimate the leading return-map coefficient and use the paper's scaling law to cap the delay or hysteresis width before an attracting optimization oscillation becomes large. The controller can also intentionally permit a small predicted cycle near saddles or plateaus, then remove the delay as soon as the measured cycle amplitude…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a diagonal learning-rate or preconditioner matrix with a small full block matrix and communicate a worker's updated gradient or parameter only when its local state has drifted sufficiently from the last communicated state. Jointly select the block preconditioner and the largest safe trigger threshold using robust Lyapunov inequalities over several empirical Hessian or Gauss-Newton matrices. The expected gain is fewer synchronization events without the instability normally caused by…
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Run multiple optimizer workers, neural-network branches, or expert replicas with delayed parameter messages, using diffusive coupling for agreement and a separately slowed local gradient vector field. The delay should preserve the collective descent direction to first order while multiplying its evolution speed by a predictable factor, allowing communication-delay robustness to be tested independently from ordinary stale-gradient behavior.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace hand-designed Heavy Ball or Nesterov coefficients with a low-order linear controller synthesized by a semidefinite program. The controller receives the stochastic mini-batch gradient and emits the parameter update; dynamic IQC multipliers constrain both gradient curvature and temporally correlated mini-batch noise, so the SDP directly minimizes a certified contraction factor rather than optimizing momentum heuristically.
Useful7/10
Difficulty7/10
Novelty7/10