△ Mechanism confirmed, baseline not beaten
2026
Replace independent expert activation or ordinary softmax routing with an exact fixed-m external-field subset router. Parameterize expert weights by logits, use the subset covariance as the Fisher matrix, and precondition router gradients with its Moore-Penrose pseudoinverse on the sum-zero subspace. The paper's resistance bound supplies a data-dependent ceiling for pairwise logit updates, preventing unstable motion when some experts have low inclusion variance.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a CPDNet-like monitor to a sequential neural model and use its soft change probability to gate online parameter updates. The model should update little or not at all during nominal operation, but rapidly increase adaptation after residuals and internal features indicate a regime change, avoiding both stale parameters and continual self-training drift.
Useful7/10
Difficulty5/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
✗ Failed on benchmark
2026
Replace the assumption that a minibatch gradient is fully Gaussian by a Gaussian center plus an explicit single-example big-jump correction. At each update, estimate the distribution of per-example gradient projections along the proposed update direction and use the predicted aggregate tail probability to reduce the step size or increase clipping only when the minibatch is in its non-Gaussian crossover regime.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Maintain a posterior over the effective stochastic-gradient noise scale and trigger expensive diagnostics or conservative optimizer changes only when uncertainty in that scale threatens a training-stability certificate. Unlike entropy-based exploration, the trigger depends on the predicted excess loss or stability gap caused by calibrating the optimizer to the wrong noise level.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build a low-dimensional neural-network geometry from trainable observables or probes instead of estimating the full Fisher matrix. Precondition the parameter gradient by the inverse variability of the probes and their parameter sensitivity, producing a task-adapted update that can remain usable for implicit models, heavy-tailed data, and parameter-dependent-support distributions.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Run a small ensemble of neural-network replicas and treat their parameter or representation distribution as a mean-field state. Estimate the linearized replica-to-replica response and its covariance eigenmodes; when the leading mode approaches the critical eigenvalue associated with a pitchfork bifurcation, reduce the learning rate or noise, and when it is safely subcritical, increase exploration. The eigenvector identifies the parameter or feature direction in which branch splitting is…
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
✗ 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
△ 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
△ 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
✗ 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
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
✓ 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
Unverified
2026
Replace a single-coordinate GP surrogate used for expensive neural-network hyperparameter trials with a finite bank of input-warped kernels. Each trial may select whichever warp currently gives the most promising upper-confidence acquisition, including after observing all previous results, while confidence parameters are enlarged to account for the finite library. This should recover the benefits of log-scaled or localized geometries without committing to one hand-designed parameterization.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace direct optimization of noisy simplex-valued mixture or MoE gate weights with a fixed number of EM responsibility updates. The finite iteration count acts as an implicit reverse-KL regularizer toward the uniform gate distribution, preserving low-frequency experts without selecting an arbitrary entropy coefficient.
Useful6/10
Difficulty4/10
Novelty4/10
Unverified
2026
Treat discrete training events such as gradient-norm spikes, curvature changes, rejected steps, or minibatch outliers as jump channels and apply an event-specific parameter update map. The optimizer should be evaluated using both progress and the information cost of selecting the feedback map, because feedback may reduce loss fluctuations or improve adaptation without changing the average update magnitude.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize the state-transition or input-output Jacobian of a recurrent, state-space, or implicit neural network so that its complex eigenvalue cloud belongs to a selected non-Hermitian symmetry class and has the corresponding unfolded pair statistics. Combine this statistical-shape constraint with an explicit spectral-abscissa or spectral-radius margin, preventing the network from obtaining good average singular values while remaining highly non-normal and transiently unstable.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Add a low-dimensional, trusted sentinel state to the optimizer or recurrent inference controller. The sentinel is driven by a secret probe and a protected gain, so unauthorized gain changes produce a predictable shift in its equilibrium even when the main neural dynamics remain numerically stable. Monitor the estimated equilibrium and trigger rollback or quarantine when the measured shift exceeds the expected noise envelope.
Useful6/10
Difficulty4/10
Novelty8/10
Unverified
2026
Train a neural state-space model whose one-step dynamics are linear in a fixed analytic feature vector, and use the empirical feature Gram matrix to detect whether passive trajectories identify the dynamics. Add data collection or replay only when the Gram matrix is poorly conditioned; the analytic-feature assumption predicts that persistent excitation should emerge without deliberately visiting every operating mode.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Partition neural modules into two empirically identified reliability or noise classes and restrict their communication graph to a two-block stochastic block model. Allocate a fixed connectivity budget across within-class and cross-class edges using a water-filling update that favors block pairs producing the largest increase in validation utility. The resulting layer is sparse and modular, with a testable prediction that optimal connectivity concentrates on a few block pairs rather than…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's MBM-GP construction to predict input-dependent big-M constants for ReLU disjunctions during neural-network verification. Exact activation-bound optimization is performed only at a small subset of input points, while a Gaussian-process upper confidence bound supplies conservative bounds elsewhere, reducing verifier preprocessing and potentially tightening the MILP compared with one global worst-case constant.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace constant friction and optimizer noise with a velocity-dependent friction gamma(u) and noise amplitude tied by a fluctuation-dissipation relation. High-speed momentum states can be damped and randomized differently from low-speed states, creating controlled transient exploration while preserving a known equilibrium momentum distribution.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use Fisher width as a branch coordinate in addition to training loss. During a short reference run with SGD, fit the expected Fisher-width curve as a function of loss, then add a soft penalty to Adam or another optimizer when its width at the same loss deviates from that reference branch. This directly tests whether optimizer-induced geometric displacement is responsible for differences in training dynamics or generalization.
Useful6/10
Difficulty5/10
Novelty6/10