✗ Mechanism failed
2026
Train a convex surrogate attached to a neural network, such as a sparse linear probe or adapter, and use its primal and Fenchel-dual representations to produce mutually consistent feature and sample masks. The same screening operation can be evaluated on columns of the primal design matrix or rows of the dual representation, allowing data and feature reduction without independently tuned heuristics.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
When a model, dataset, or parameterization has an involutive symmetry, transform gradients and curvature into symmetry sectors before applying adaptive updates. The Hessian and optimizer can then be handled as independent even and odd blocks, preventing curvature from one sector from forcing an unnecessarily conservative learning rate in the other.
Useful7/10
Difficulty4/10
Novelty6/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
✗ 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
✗ Mechanism failed
2026
Replace fixed Gaussian noise in a private optimizer with generalized-Gaussian noise whose shape p is selected for the actual clipped-gradient sensitivity and privacy budget. For every candidate p, numerically find the minimum scale b satisfying the hockey-stick privacy constraint, then choose the p minimizing a gradient-update utility moment such as variance or expected absolute magnitude.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a fixed learning-rate and momentum rule with a low-order dynamic feedback controller mapping gradients, optimizer state, loss trends, and parameter statistics to the update magnitude. Synthesize or fit the controller against structured uncertainty in curvature, gradient noise, minibatch delay, and layerwise scaling, then enforce a worst-case closed-loop gain below one. This targets catastrophic optimization failures caused by combinations of uncertainties that are not visible in a…
Useful7/10
Difficulty8/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Partition a neural network into interacting modules and constrain the product of their local finite-region gains and coupling strengths so that the resulting gain matrix has spectral radius below one. This transfers the paper's small-gain-like mechanism and gives a quantitative large-signal boundary: instability or exploding activations should emerge as the spectral radius approaches one, while a weighted Lyapunov function should contract below that boundary.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Modify an L-BFGS curvature pair only when the observed secant curvature is negative. Replace the gradient-difference vector by the smallest Euclidean or inverse-metric correction that enforces positive curvature, then use the unmodified BFGS update and two-loop recursion. This avoids the computational and conditioning cost of adding a large isotropic damping term to the whole inverse-Hessian approximation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Partition neural-network parameters into blocks and update each block using a stochastic proximal best response, followed by Krasnoselskii relaxation. The relaxation factor and minibatch size become explicit stability knobs: aggressive stochastic updates are damped, while larger batches are used when the estimated update variance approaches the mean-square stability boundary.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a full Hermitian curvature matrix, such as a Hessian or empirical Fisher matrix, by its block-diagonal version only when the paper's perturbation certificate predicts a small eigenvalue change. Use the certificate online to merge poorly separated blocks and retain independent preconditioners for well-separated blocks, yielding a controllable accuracy-memory tradeoff rather than a fixed block-diagonal approximation.
Useful7/10
Difficulty6/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent or state-space update with a delayed continuous-time hidden-state block and constrain its local closed-loop Jacobian using an output-to-output dissipativity LMI. The certificate bounds amplification from external perturbations, such as corrupted observations, injected hidden-state noise, or delayed-input errors, to the task output. Training rejects or penalizes parameter updates for which the certified gain becomes too large.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the usual inverse-Hessian implicit hypergradient with the derivative of the minimum-norm inner solution. Compute it as the limit of derivatives of a uniquely solvable Tikhonov-regularized problem, using a decreasing damping parameter and conjugate-gradient solves. This should make bilevel training usable when the inner model is overparameterized or has flat directions.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Train two parameter replicas with symmetric coupling, treating one replica as a prepared thermalization packet for the other. Estimate the slow local Hessian direction and initialize or periodically reset the packet so that the coupled state has zero projection onto that mode; the target should then relax according to the next-slowest mode rather than the original bottleneck.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Mechanism failed
2026
Constrain a set of learnable or batch-produced unit-norm embeddings by matching their spherical-harmonic power spectrum to a target spectrum rather than relying only on pairwise Euclidean repulsion. This creates an explicit, tunable mechanism for suppressing low-frequency density fluctuations or enhancing a selected angular frequency, which can improve uniformity and reduce representation collapse on hyperspherical embeddings.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a family of nearby neural-network parameter updates by a low-dimensional polytope around the current parameters, and retain only the convex inner region whose predicted nonlinear training dynamics remain close to actual dynamics. Optimize the training objective over this trusted family with a small quadratic program rather than testing many independent candidate steps. The method turns a scalar learning-rate choice into a reusable set of jointly safe update directions.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Treat the optimized surrogate and the training trajectory as objects that require a decision-level audit. Use multistart optimization to count phantom optima, and periodically evaluate whether stochastic training has changed the surrogate optimum even when validation prediction error remains nearly constant; stop, roll back, or average checkpoints when decision drift exceeds a threshold.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Constrain a recurrent or state-space neural network to keep its hidden state inside an ellipsoid that is robustly invariant under bounded feature inputs, hidden-state perturbations, and model mismatch estimated from offline trajectories. The ellipsoid and a stabilizing recurrent gain are fitted from data through an SDP-inspired certificate, then used either as a training regularizer or as a projection layer at inference time.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace Muon's single momentum matrix with a weighted mixture of fast and slow relaxation modes. The fast mode tracks rapidly changing gradients while the slow mode preserves a longer-horizon direction; their mixture is semi-orthogonalized and applied as the matrix update.
Useful7/10
Difficulty4/10
Novelty6/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
Train a neural controller or learned dynamics model against a finite-horizon set-valued certificate rather than only sampled trajectories. Represent uncertain states and bounded disturbances with hybrid zonotopes, propagate them through affine dynamics and a piecewise-linear neural network, and penalize reachable-set violations and failure to contract into a terminal set. This turns rare worst-case failures into a directly optimized geometric objective.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Use the forward-backward reversal error as an online reliability signal: save more checkpoints or increase the low-rank dimension only when reversing a block produces a large defect. This turns the paper's observations about chaotic low-rank trajectories and rank deficiency into an adaptive memory-versus-gradient-accuracy controller.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace Euclidean momentum for selected neural parameters with a mirror or Bregman update, while using the paper's accelerated Newton direction for the objective step. Entropy geometry is especially suitable for softmax MoE routers, while Euclidean or log-barrier geometries can be used for unconstrained or positive parameters.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Build a recurrent or state-space model with a base state carrying task-relevant dynamics and an explicitly contracting auxiliary state. If the training loss or energy depends on the auxiliary state, replace it by a quotient loss plus an analytically known telescoping correction; long-run optimization and invariant averages are then unchanged, while transient fiber effects decay geometrically.
Useful7/10
Difficulty5/10
Novelty8/10