Unverified
2026
Use a low-dimensional polynomial model of local training dynamics to detect when the leading nonlinear restoring behavior becomes degenerate. Shrink the optimizer step in that region, or fit higher-order terms before restoring it, because the paper shows that quartic nondegeneracy determines whether local nonlinear stability can be certified and that sixth-order terms resolve inconclusive cases.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a cheap directional curvature-defect estimator to an SGD or AdamW optimizer and shrink the step size only when the local gradient field loses the nominal contraction margin. Unlike a Hessian-norm trust-region rule, this directly measures the quantity that appears as additive instability in the Euler coupling estimate.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Give a token, patch, retrieval-item, or expert-selection module a learned utility f_theta(S) over subsets S, and penalize violations of the paper's submodularity and strong-submodularity inequalities. The resulting selector should prefer complementary elements: the marginal value of adding an item decreases when the current selected set is already rich in similar information. At inference, use greedy marginal-gain selection rather than independently thresholding token scores.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Use a PEP-generated quadratic Lyapunov function as a runtime monitor for minimax training. When the measured Lyapunov decrease becomes positive, reduce the learning rate or reset optimizer memory; when the decrease is safely negative, retain or cautiously increase the step size.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained recurrent residual update with a sparse coordinated state-space block whose gains and state radii are synthesized jointly by a linear program. The block receives bounded feature disturbances, keeps every hidden coordinate inside a certified interval for all time, and uses an affine feedforward correction to reduce the output sensitivity of downstream coordinates.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained recurrent reset gate with a threshold policy over hidden-state age and a scalar degradation score. The model continues its recurrence while the estimated cost of retaining the state is below the cost of restarting, then resets and reinitializes the state when the threshold is crossed. This should reduce long-horizon hidden-state drift while using only one scalar gate per sequence position.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add KL Tikhonov regularization to simplex-valued attention or routing parameters so that the optimizer selects a stable solution close to a chosen reference distribution instead of collapsing onto a few entries. Anneal the regularization strength to obtain exploration early and specialization later.
Useful6/10
Difficulty3/10
Novelty4/10
Unverified
2026
Replace independent top-k routing by a tree-structured hypergraph assignment layer. Each candidate route is a singleton or pair of resources, and the router selects exactly q_e routes for every tree edge e while ensuring that no resource is consumed twice. This removes capacity collisions before expert computation instead of repairing them with token dropping or load-balancing penalties.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Train a neural state-feedback controller together with a positive Lyapunov critic so that the closed-loop system decreases a Lyapunov function for every plant matrix inside the data-consistent uncertainty ellipsoid. Replace the paper's exact SOS constraints by differentiable sampled constraints or inner maximization over uncertain plant parameters, yielding a controller that is explicitly robust to measurement noise and system-identification error.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use a low-degree residual polynomial of the neural-network Hessian rather than an interval-only Chebyshev polynomial, with the polynomial minimized over the bulk Hessian spectrum and isolated outlier eigenvalues simultaneously. The method should reduce oscillation caused by rare sharp directions without shrinking the learning rate for the bulk spectrum.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Maintain an SPD matrix preconditioner with the paper's deterministic Ornstein–Uhlenbeck covariance recursion rather than estimating an inverse through Newton–Schulz or an explicit matrix inverse. Apply this preconditioner to gradients from a small layer block, using damping and a conservative step size to preserve positive definiteness. The method is most plausible for low-rank, per-layer, or blockwise curvature matrices where dense matrix storage is affordable.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a stationary federated optimizer with a decentralized optimizer whose target distribution explicitly forgets old streaming samples. Each round performs only K consensus-gradient iterations, with K selected from the mixing contraction so that the communication budget matches the temporal volatility of the objective. The method should react faster to distribution shifts while limiting disagreement and bias caused by heterogeneous clients.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace direct parameter updates with a hierarchical controller. An upper loop converts the minibatch gradient into a bounded desired parameter velocity, while a lower loop drives the actual velocity toward that reference through feedback and feedforward compensation. This should suppress minibatch-induced velocity spikes, make the maximum parameter displacement explicit, and preserve stable behavior when gradient estimates or curvature models are inaccurate.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use a rapidly cycling preconditioner or learning-rate vector during optimization, but construct a static averaged optimizer with the same mean update. When the parameter dynamics are locally contractive, the averaged optimizer should track the periodic optimizer while requiring less schedule bookkeeping and potentially fewer expensive state updates.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace the purely diagonal preconditioner in AdamW or SGD with a blockwise, single-secant BFGS inverse-curvature metric. Use spectral damping and clipping relative to the diagonal RMS metric so the learned metric cannot become arbitrarily ill-conditioned, mirroring the paper's uniform comparison between its conjugate-free scaling and the primal barrier Hessian.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace count-only MoE load balancing with greedy balancing of aggregate token-feature vectors. A token is assigned to the expert for which adding its feature vector produces the smallest increase in that expert's squared aggregate norm, encouraging experts to receive complementary semantic mixtures rather than identical token counts.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace the ordinary update in a differentiable minimax game with a Halpern-anchored second-order operator step. The current game iterate is first corrected using the local Jacobian of the game gradient, and the corrected point is then contracted toward a fixed anchor with a decreasing Halpern weight. This is intended to reduce cycling in adversarial training while preserving the faster asymptotic behavior associated with second-order monotone-operator methods.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Grow a mixture-of-experts layer by splitting one expert into two children while conserving its routing mass, and choose the split ratio to minimize the worst imbalance over all intermediate expert counts. Use the paper's sharp threshold as a hard design target: with n experts, some intermediate stage must have capacity ratio at least D_n = 2^{1-1/\lceil n/2\rceil}, so schedules substantially below this are impossible rather than merely difficult to discover. Initialize child router logits with…
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a continuous allocation or routing decision with a lattice-valued decision whose unit size is explicitly normalized by total capacity. Round allocations downward rather than to the nearest lattice point, preserving per-example capacity feasibility, and train or evaluate against the resulting granularity ratio rather than treating discretization as an implementation detail.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a Gaussian or point-estimate regression head with a heteroscedastic Student-t head whose scale and degrees of freedom depend on the learned state. This gives the model a principled way to absorb abrupt, nonmonotone events and operating-condition shifts without forcing the central degradation trend toward rare extreme residuals.
Useful6/10
Difficulty3/10
Novelty4/10
Unverified
2026
Replace the scalar learning rate of SGD or Adam's outer update by a blockwise Barzilai--Borwein estimate computed from consecutive parameters and gradients. Use gradient smoothing, denominator checks, and clipping so that the curvature estimate remains usable with stochastic neural-network gradients.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace backpropagated gradients in a Langevin sampler with a simultaneous-perturbation estimate obtained from two noisy evaluations of a neural energy or simulator-defined negative log-density. This enables posterior or latent-space sampling when the energy contains nondifferentiable code, stochastic simulation, discrete operations, or an inaccessible neural-network gradient.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace top-k token pruning by greedy maximization of a diversity-aware monotone submodular utility under a spacing or coverage constraint. The selector repeatedly chooses the feasible token with the largest marginal utility, avoiding the redundant-token failure mode of independent score ranking while inheriting a constant-factor approximation guarantee under the stated 2-system abstraction.
Useful6/10
Difficulty5/10
Novelty6/10