△ Mechanism confirmed, baseline not beaten
2026
Add a controlled antisymmetric component to the local parameter update so optimization can circulate around ill-conditioned valleys instead of moving only along gradient directions. The symmetric component supplies dissipation, while the skew component produces the oscillatory non-reciprocal response predicted by the paper. Adapt the skew strength only while the estimated discrete-time dynamics remain stable.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Attach a model-free critical-slowing-down monitor to hidden states, actions, residuals, or losses generated by a recurrent neural controller or state-space model. When the monitored dynamics show increasing variance and lag-one autocorrelation, reduce the controller gain or optimizer learning rate, increase damping, shorten the rollout horizon, or switch to a fallback policy before the neural system reaches an unstable regime.
Useful7/10
Difficulty4/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Use measured local Jacobian growth to set the variance of dropout, feature noise, or stochastic-depth perturbations, implementing the paper's fluctuation-response idea that multiplicative noise is tied to the positive scrambling or Lyapunov rate. The controller maintains a target growth regime instead of applying a fixed noise schedule throughout training. It predicts a stability transition when the estimated growth rate crosses zero and a variance-growth proportionality that can be tested…
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Use the paper's sharp sK approximately equal to 1 phase transition to choose between conservative Fejer averaging and higher-order polynomial filtering. When the local fixed-point spectrum is separated from eigenvalue 1, use a Jackson-type filter; near the critical regime, use the safe Fejer filter instead of unrestricted Anderson extrapolation.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the inner step of a neural optimizer with a safeguarded cubic local-model solve. Represent the cubic Taylor model as a homogeneous tensor in an augmented coordinate, solve proximal unit-sphere subproblems by alternating tensor contractions, decode a candidate step, and accept it only when the actual neural loss confirms the predicted decrease.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Let a neural policy emit an unconstrained abstract action z, then solve a state-dependent feasibility problem that maps z to an admissible optimal-control parameter p before execution. Unlike coordinate-wise clipping, the mapping accounts for predicted dynamics, coupled state and input constraints, and recursive feasibility, allowing the policy to retain a simple unconstrained output space while the controller enforces plant constraints.
Useful7/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Replace constant decoupled weight decay with a coefficient proportional to the current learning rate divided by the peak learning rate. The optimizer applies ordinary decay at the learning-rate peak but weakens decay during cooldown and late training, preventing unnecessary steady-state parameter-norm shrinkage while retaining early-training stabilization.
Useful7/10
Difficulty2/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Augment SGD or momentum with a state observer that estimates the slowly varying component of minibatch-gradient disturbance from one-step parameter-transition residuals. Cancel the estimated disturbance with feedforward correction, then apply a curvature-dependent robust feedback gain whose closed-loop dynamics satisfy a discrete stability or bounded-gain condition.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Implement a momentum optimizer as a contact Hamiltonian splitting rather than as a direct Euler discretization. Introduce an auxiliary scalar contact state and compose exact kinetic, potential, and damping subflows; this produces a second-order conformal integrator whose modified contact energy should decay more reliably at moderately large learning rates.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace generic learning-rate selection in decentralized or federated gradient tracking with a low-dimensional minimax search over the exact scalar-mode pole radius. The optimizer chooses the step size that minimizes the worst predicted contraction over the observed graph spectrum and an estimated curvature interval, rather than relying only on conservative global bounds.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use a learned quasipotential barrier as feedback for optimizer noise and restart control. Increase stochasticity when training is trapped in a high-loss metastable basin and reduce it near a desirable basin, with switching thresholds determined by the estimated barrier rather than by a fixed patience schedule.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace independently restarted proximal-gradient or quasi-Newton solves for a composite neural objective with a curvature-recycling Douglas–Rachford loop. The previous proximal state, residual, and limited-memory BFGS curvature pairs are transported to the next proximal center, reducing expensive loss and gradient evaluations while retaining the cheap nonsmooth proximal operation.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a fixed SGD learning rate with a per-update step selected from the positive curvature observed along the proposed direction. The controller estimates the directional Taylor remainder using one or two function evaluations, increases the step when the observed direction is benign, and backtracks only when the update fails a sufficient-decrease test.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a single optimizer trajectory by N parameter particles and optimize the time until the first particle reaches a target loss or reward threshold. Use distinct interaction regimes: bounded normalized interactions should provide only the usual logarithmic extreme-search improvement, whereas unnormalized coherent force accumulation and stochastic pairwise kicks should produce distinct 1/N and 1/(N ln N) first-hit laws.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train a mixture-of-experts router by solving its regularized nonnegative simplex least-squares subproblem with a matrix-free active-set conjugate-gradient method instead of projected gradient or Adam. The router coefficients remain exactly nonnegative and sum to one, while CG rapidly solves each free-set quadratic and the active-set pivots identify sparse expert assignments.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent the propagation of hidden states, layer states, or optimizer states by a locally estimated transfer operator and monitor its leading eigenvalue gap. When two dominant modes undergo an avoided crossing, reduce the update scale or increase damping; after the gap reopens, restore the normal schedule. This imports the paper's sharp-but-continuous pseudo-transition mechanism rather than treating instability as a binary divergence event.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Track a symmetry-asymmetry functional of network outputs or hidden states under a chosen transformation or channel and estimate which relaxation modes control its late-time decay. Use a short warm-up trajectory to suppress the slow asymmetry mode while allowing larger initial asymmetry in faster modes, producing a training trajectory that can overtake a nominally better-initialized trajectory. This transfers the paper's quantum Mpemba effect as a mode-overlap principle rather than requiring an…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace purely Gaussian optimizer noise with symmetric alpha-stable jumps and add a restoring drift toward an exponential-moving-average parameter anchor. The drift prevents persistent parameter diffusion, while heavy-tailed jumps provide rare, large excursions that can cross sharp basin barriers and remain effective when gradient-noise variance is undefined.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Wrap a neural policy or neural dynamics model in a short-horizon predictive optimizer that enforces explicit bounds on a learned interaction variable before applying the next action. This separates disturbance rejection and tracking from safety: the network may propose aggressive corrections, but the optimizer projects them onto actions whose predicted force, state, and actuator trajectories remain feasible.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the usual parameter-plus-momentum Langevin state with a three-level chain consisting of parameters, velocity, and acceleration, while injecting Gaussian noise only into the highest auxiliary state. At a saddle, the escaping direction has a positive rate given by a cubic characteristic equation; use this rate to choose damping or adapt the temperature so that basin escape is accelerated without making the dynamics unstable.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace synchronous replicated-gradient computation with a bounded-staleness stream: at optimizer step t, aggregate one gradient for each data partition, using the newest completed evaluation even if it was computed at an earlier model version. Replicated partition placement makes the aggregate robust to stragglers, while pipelining ensures that each worker computes only one partition gradient per step.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Construct a robust covariance estimate of layer activations by replacing each feature with its empirical Gaussian normal score before eigendecomposition, then applying coordinate-wise nonlinear eigenvalue shrinkage rather than multiplying all eigenvalues by one scalar. Use the cleaned covariance to whiten activations or precondition updates to the associated linear layer. This targets unstable directions caused by small batches, heavy-tailed activations, and rare outliers while retaining…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a neural-network optimizer's globally fixed learning-rate geometry with an adaptive quadratic trust region. At every update, construct a local curvature model, accept or reject the step using the ratio between realized and predicted loss decrease, and expand or contract the radius accordingly; the same controller should automatically become conservative in nonconvex regions and Newton-like near a well-conditioned minimum.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace ordinary graph propagation by diffusion with a positive node-dependent mass matrix \(\mathbf V\), so high-volume nodes update slowly and low-volume nodes update rapidly. Use node volumes as fixed metadata, a function of degree, or learned positive gates; this makes the architecture sensitive to dynamical localization that degree-normalized GCNs cannot represent.
Useful7/10
Difficulty5/10
Novelty7/10