✗ Failed on benchmark
2026
Augment an optimizer with a measurable redistribution time for its internal state and compare it with the time scale of the changing gradient field. Use the resulting Damkohler number to interpolate between a fast quasi-static preconditioner and a history-preserving, non-equilibrium update, rather than applying one optimizer regime throughout training.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Treat the hidden-state evolution of an RNN or state-space model as a parameterized dynamical system and globally continue its attractors over a grid of inputs, perturbation amplitudes, and training checkpoints. Penalize or stop training when the task-relevant attractor loses basin mass, rather than relying only on local Jacobian eigenvalues at one nominal trajectory.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Treat the sequence of recurrent or state-space Jacobians along a trajectory as a noncommutative matrix cocycle, analogous to the time-dependent offspring mean matrices in the branching model. Estimate its finite-horizon growth exponent and use it to adapt spectral normalization or recurrent gain, targeting a slightly negative exponent for stable memory without uncontrolled exploding dynamics.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the usual averaged Jacobian test for a periodically modulated neural update with a finite harmonic-transfer model that explicitly couples perturbation frequencies separated by the modulation frequency. Use the resulting lifted spectral radius to cap the learning rate or reduce modulation amplitude when sideband interactions create an instability that is invisible in the averaged model.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace isotropic parameter penalties and diagonal Fisher estimates with a task-covariance interference budget. The update is damped only in directions where old-task features have large variance, while directions absent from old-task feature support remain available for learning the new task. This may preserve old-task performance with less loss of plasticity than unconditional projection.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Train a neural state-space model using all replayed transitions, but assign larger weights to samples near the current operating context rather than discarding distant samples. Add a strictly positive weight floor so local adaptation cannot eliminate global coverage or make the regression problem rank-deficient. This should improve prediction across nonlinear regimes while retaining the numerical robustness of full-data training.
Useful7/10
Difficulty4/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Equip a neural policy or learned world model with an MPPI-style rollout planner whose perturbation covariance is conditioned on a discretized latent-state cell and updated from observed transition residuals. Apply spatial diffusion to neighboring covariance estimates using a kernel matched to the empirical visitation distribution, so covariance adaptation is smoothing rather than an unstable independent estimate at every state.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the reachability verifier as an optimization controller: permit a neural controller update only when the proposed parameter step remains inside a certified STL-safe trust region, and shrink the region when the reachable robustness margin collapses. This turns verification from an expensive final check into feedback that prevents gradient descent from crossing a temporal-logic feasibility boundary.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Measure how validation forecast error grows with prediction horizon and fit exponential and Mittag-Leffler models. When the Mittag-Leffler fit is decisively better, activate a fractional-memory SSM or long-memory residual branch and use its fitted effective order to set the branch's kernel decay and horizon-loss weights; otherwise retain a conventional recurrent or finite-memory branch.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Make a diffusion policy or MPPI-style action-sequence sampler less committed to model-predicted cost rankings when the learned world model is inaccurate. Estimate a normalized prediction residual or ensemble disagreement, increase the sampling temperature with that residual, and retain ordinary low-temperature exploitation when the model is accurate.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a single LoRA parameter vector with a weighted population of candidate vectors. Candidates receive an exponentially filtered reward from minibatch validation loss; above-average candidates replicate while Gaussian mutation preserves exploration. The normalized selection rule conserves total population mass and avoids relying on noisy single-step gradients.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Treat optimizer configurations as elements of a finite intervention poset and decompose validation loss or training traces into pure causal effects rather than raw ablation differences. The recovered second- and higher-order effects reveal whether, for example, momentum and adaptive preconditioning are complementary, redundant, or destabilizing, and can be used to select a smaller optimizer or construct a better configuration.
Useful7/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace gradient updates for one branch's final linear layer at a time with an exact ridge least-squares solve while holding the other branches, trunk, and hidden layers fixed. The method applies to any model whose output is a sum of products of branch factors and a trunk factor, including MIONets and tensorized neural networks.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace ordinary randomized coordinate descent inside a least-squares neural subproblem with RPLSS's projected direction update. Each sampled parameter coordinate generates a Jacobian column, while the stored matrix P removes components already covered by previous updates; this should reduce redundant coordinate steps and improve convergence for linear heads, LoRA modules, and locally linearized fine-tuning.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an opaque adaptive-optimizer state update with a small controller variable obtained by minimizing a strongly convex energy jointly associated with the proposed parameter motion. The controller is allowed to relax toward the current gradient before the parameter update, while the visible update uses the reduced energy and its envelope gradient. This creates an optimizer whose hidden geometry is optimized rather than inherited from a fixed exponential-moving-average recurrence.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the fixed numerical stabilizer in signSGD by an exponentially decaying stability path, so the optimizer remains sign-like for a controllable duration instead of eventually reverting toward ordinary gradient descent as gradients become small. Sweep the decay rate as an explicit implicit-bias parameter: slower annealing should retain the non-Euclidean, barrier-like bias, while faster annealing should approach the sign endpoint more closely.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Treat every low-rank basis refresh as a change of coordinates instead of assuming that old optimizer coordinates remain aligned with the new basis. Transport the first moment with the basis-overlap matrix, but collapse the second moment to a rotation-blind isotropic estimate rather than applying the same coordinate transformation to elementwise squared moments. This should eliminate second-moment staleness while preserving the memory savings of low-rank optimization.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Use a smoothed Burg entropy as the mirror map in a proximal-gradient optimizer for positive or simplex-valued neural parameters. The optimizer performs a Bregman-proximal step instead of an additive Euclidean update, while the smoothing parameter avoids the singularity of ordinary Burg entropy at zero.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace independent Hutchinson vectors used to estimate traces of neural-network curvature operators with graph-coloring probing vectors. Coordinates that are far apart in an interaction graph share a color, so one probe simultaneously covers many coordinates while reducing variance from localized off-diagonal matrix entries. Apply this to Hessian-trace regularization, Fisher-trace diagnostics, or layerwise curvature estimates used by adaptive optimizers.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Use the differentiable covariance chart to construct a Fisher-information preconditioner for the edge and innovation parameters of a linear-Gaussian neural module. Instead of applying an isotropic Euclidean update, whiten parameter steps according to how strongly they change the predicted Gaussian distribution. This targets ill-conditioning caused by redundant paths, correlated latent nodes, and badly scaled innovation covariances.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the sign-flip-only dynamics of high-index saddle search with low-rank inverse-curvature scaling on the estimated negative-curvature subspace. Directions with small negative Hessian eigenvalues then receive approximately curvature-independent updates instead of extremely slow updates proportional to their tiny curvature.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Construct a positive learning-rate schedule offline by minimizing the worst residual of every prefix on a normalized curvature interval, rather than optimizing only the final training horizon. The schedule is evaluated through the exact quadratic residual polynomial p_n(lambda) = product_{k=1}^n (1 - eta_k lambda), so every prefix is constrained to make progress across multiple curvatures.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace full-precision all-reduce parameter averaging in synchronous distributed training with the paper's compressed gradient-tracking recursion. Each worker maintains a model state, a gradient-tracker state, and two communication memories; only compressed differences from the memories are exchanged, while the tracker preserves the global-gradient increment despite compression.
Useful7/10
Difficulty6/10
Novelty5/10
✓ Mechanism works
2026
Search for a compact symbolic optimizer instead of selecting among fixed AdamW-like formulas. Encode optimizer programs as token sequences, learn a continuous variational representation of those sequences, and use a Gaussian-process Bayesian optimizer to propose promising update rules based on short neural-network training rollouts.
Useful7/10
Difficulty6/10
Novelty6/10