✓✓ Beats tuned baseline
2026
Replace full-KKT implicit differentiation through a constrained quadratic-program layer with differentiation through only the equality constraints and inequalities active at the optimum. The forward solver still enforces all constraints, but the backward linear system scales with the active-set size rather than the total number of inequalities.
Useful8/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Replace a single optimizer update rule by a finite set of update modes, such as conservative SGD, momentum SGD, high-step SGD, and Adam-like preconditioned descent. Because the selected mode is applied with a one-step delay, score every candidate using a nominal predictor and choose the mode with the greatest certified decrease of a phase-dependent Lyapunov function around a short periodic optimizer orbit. This creates a controlled limit cycle in parameter or loss-state space, allowing stable…
Useful8/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
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
✓✓ Beats tuned baseline
2026
Initialize latent coordinate-frame parameters analytically from two temporally separated neural predictions instead of starting joint optimization from arbitrary translation and orientation. This removes the continuous gauge before backpropagation and should prevent EKF-like or gradient-based failures caused by large yaw and position initialization errors.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Mechanism failed
2026
Model gradient clipping as a piecewise-smooth optimizer with an unsaturated update mode and a norm-saturated update mode. Estimate the branch slope immediately after clipping activates; a positive slope predicts that a stable training state persists under clipping, while a nonpositive slope predicts an immediate non-smooth fold and potential loss or oscillation.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
When the training objective uses only the optimal value of a differentiable quadratic program, bypass the adjoint KKT solve entirely and differentiate the value with respect to neural predictions using the envelope theorem. This is especially suitable for decision-focused learning where the network predicts costs, loads, or constraints and the loss is the resulting optimal operating cost.
Useful7/10
Difficulty3/10
Novelty4/10
✗ Mechanism failed
2026
Add a scalar integral/sliding variable and a resettable auxiliary state to parameter optimization. The sliding controller rejects bounded gradient perturbations, while resetting the auxiliary state prevents accumulated momentum or integral windup; the reset mechanism is designed not to alter the reaching dynamics of the sliding surface.
Useful7/10
Difficulty5/10
Novelty8/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
✗ Mechanism failed
2026
Treat parameter-space curvature modes as RG momentum shells and use a smooth cutoff to construct a scale-dependent preconditioner rather than abruptly clipping eigenmodes. The optimizer should expose measurable crossovers between overdamped, KPZ-like, and nearly inviscid relaxation, allowing the learning rate and damping to change at empirically detected transitions instead of following a fixed schedule.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace ordinary momentum-like accumulation with a PI controller whose integral state is reset when the proportional error changes sign, indicating that the trajectory has crossed its local target. Apply the mechanism to each parameter block or to a scalar block residual, and impose a dwell time so that minibatch noise cannot trigger arbitrarily frequent resets.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace ordinary gradient descent or momentum with a discrete PI update whose integral gradient state is accumulated only while the gradient direction remains consistent. When the proportional gradient term changes sign, reset the integral state, preventing stale gradients from producing overshoot near minima or after sharp curvature changes.
Useful7/10
Difficulty4/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Use a bounded stochasticity control during an initial preparation window to shape the gradient or parameter-update distribution before ordinary training. The control is restricted to its minimum or maximum value, with at most one switch, because the reduced moment dynamics are affine in the control; this gives a falsifiable alternative to smooth noise or learning-rate annealing.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed or manually scheduled learning rate with a feedback controller that estimates the critical rate of a saddle-node-like training mode and slows the schedule before the mode overshoots. The controller is applied to a low-dimensional observable of training, while ordinary gradient updates remain unchanged. It should permit aggressive learning-rate increases away from the bifurcation and automatically reduce them near a sharp stability boundary.
Useful7/10
Difficulty5/10
Novelty7/10