✗ Failed on benchmark
2026
Replace explicit zero-padding before FFT convolution by the paper's mixed-radix decomposition, which injects zeros through bounded tile sums and never allocates the padded input. The resulting transform is mathematically identical to the length-M transform of the explicitly padded signal, while reducing temporary storage and potentially memory bandwidth.
Useful7/10
Difficulty7/10
Novelty6/10
✗ Failed on benchmark
2026
Insert a linear Johnson–Lindenstrauss bottleneck around a set of jointly processed representations, choosing its width from the sharp finite-set dimension bound rather than from the model's nominal hidden size. The projection should preserve pairwise distances between tokens, patches, or retrieved items, allowing a downstream attention or MLP block to operate at lower width while retaining the geometry relevant to similarity computations.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Use trajectory sensitivities to remove neural units or parameter groups whose effects are redundant over the available data support. A parameter group is pruned when its Fisher contribution is small or its sensitivity is nearly collinear with other groups, producing a compact neural ODE without relying only on parameter magnitude.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Treat a neural hidden-state process as a finite or discretized continuous-time Markov chain and define a target event as first entry into a target state set. Instead of estimating the derivative of the mean hitting time by expensive long rollouts, build an auxiliary regenerative chain that resets to the source state after reaching the target and estimate the same response from its stationary distribution. Penalize disagreement between this response prediction and short empirical perturbation…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Use Owen-scrambled Sobol points instead of independent Gaussian seeds for batched diffusion sampling, mapping each cube point through the component-wise inverse Gaussian CDF and the model's probability-flow ODE. Estimate ensemble expectations with importance weights computed from the target-to-proposal density ratio, so the estimator remains valid despite finite-step and learned-score transport errors.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Represent training near a switching condition as two locally smooth optimizer modes, such as low- and high-momentum updates or two preconditioners, with a delayed gate. Estimate the leading return-map coefficient and use the paper's scaling law to cap the delay or hysteresis width before an attracting optimization oscillation becomes large. The controller can also intentionally permit a small predicted cycle near saddles or plateaus, then remove the delay as soon as the measured cycle amplitude…
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a diagonal learning-rate or preconditioner matrix with a small full block matrix and communicate a worker's updated gradient or parameter only when its local state has drifted sufficiently from the last communicated state. Jointly select the block preconditioner and the largest safe trigger threshold using robust Lyapunov inequalities over several empirical Hessian or Gauss-Newton matrices. The expected gain is fewer synchronization events without the instability normally caused by…
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Run multiple optimizer workers, neural-network branches, or expert replicas with delayed parameter messages, using diffusive coupling for agreement and a separately slowed local gradient vector field. The delay should preserve the collective descent direction to first order while multiplying its evolution speed by a predictable factor, allowing communication-delay robustness to be tested independently from ordinary stale-gradient behavior.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the naive pseudospectral evaluation of a quadratic neural-operator nonlinearity with a two-point split-form product. Use the entropy-stable (alpha, beta) = (1/3, 2/3) split as the default, or learn alpha under the consistency constraint alpha + beta = 1 while monitoring energy growth. The goal is to suppress weakly underresolved aliasing and prevent long-horizon rollout blow-up without full 2/3-rule zero-padding.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the usual momentum schedule in a neural-network optimizer with a discretization of the paper's lemniscate-acceleration ODE. The method uses a time-dependent friction coefficient that is initially very large and then decays according to lemniscate sine and cosine functions, targeting faster reduction of the gradient norm than constant-momentum SGD or standard Nesterov schedules.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Replace hand-designed Heavy Ball or Nesterov coefficients with a low-order linear controller synthesized by a semidefinite program. The controller receives the stochastic mini-batch gradient and emits the parameter update; dynamic IQC multipliers constrain both gradient curvature and temporally correlated mini-batch noise, so the SDP directly minimizes a certified contraction factor rather than optimizing momentum heuristically.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the fixed momentum time constant in a neural optimizer by an online estimate of the effective update-lag time constant. Model the optimizer velocity as a first-order actuator, use a composite prediction-error identifier to adapt the time constant, and constrain the estimate to remain positive; the method should identify the correct time constant after a finite informative transient even when the gradient history is not persistently exciting.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace magnitude pruning in a trained recurrent network with stochastic pruning probabilities computed from weight magnitudes and the covariance of neuron activities under injected noise. Connections whose endpoints fluctuate in a sign-compatible way receive higher retention probability, while retained weights are rescaled to preserve average recurrent strength. The method uses local weights and activity covariance, avoiding Hessian construction and expensive global saliency optimization.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Construct optimizer variables as interconnected Hamiltonian subsystems: parameters store potential energy, momentum stores kinetic energy, and a skew coupling transfers energy between them without net creation. Positive-semidefinite resistance removes energy and provides an explicit damping knob, separating conservative exploration from dissipative convergence.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace pointwise curvature-based learning-rate decisions with a slow-fast entry-exit scheduler. The optimizer maintains a slowly varying state representing effective curvature or gradient-noise level, accumulates the weak transverse growth rate along that slow trajectory, and changes learning regime only when the accumulated rate returns to zero. This permits controlled passage through locally unstable or poorly conditioned regions while preventing indefinite residence in a regime with net…
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace the single global MoE capacity factor with expert-specific capacity reservations chosen from a small reliability menu. Experts with highly variable or operationally important token loads receive larger robust buffers, while predictable experts run closer to their mean load. This should reduce token dropping and padding waste simultaneously, especially under distribution shift or bursty routing.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace unrestricted continuous batching with a fairness-constrained scheduler that only inserts a waiting request when its predicted decode footprint remains within a normalized distance of the longest request already in the batch. The fairness budget should be tuned away from the mathematically worst midpoint and validated against real arrival distributions, with the goal of reducing wasted max-driven decode work without falling back to inefficient one-request-at-a-time serving.
Useful7/10
Difficulty4/10
Novelty6/10
✗ Failed on benchmark
2026
Augment an optimizer with a periodic phase and deliberately use a cyclic learning-rate or momentum forcing whose averaged dynamics have an attracting low-dimensional set. Treat the resulting periodic parameter orbit as an invariant torus and tune the schedule so transverse contraction dominates tangential sensitivity and minibatch perturbations. The goal is a robust, phase-locked training orbit that explores parameter space without losing attraction toward a useful solution manifold.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Train an admission or MoE routing gate not only to reduce its immediate workload, but also to preserve the ordering between a controlled trajectory and a baseline trajectory under the same request stream. Penalize counterfactual events in which the controlled system, after initially rejecting work, later exceeds the baseline workload because its changed state causes a large job to be admitted.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace unconstrained neural-network updates by updates projected toward directions supported by a recent, regularized gradient or feature subspace. This transfers PRPC's errors-in-variables correction: directions that are weakly identified by noisy or rank-deficient minibatches receive stronger shrinkage, preventing large updates caused by accidental correlations. The method is especially suitable for recurrent, world-model, and small-data fine-tuning problems where minibatch covariance is…
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a static batch size with a schedule optimized for a prescribed learning-rate schedule and a fixed total number of processed examples. Steps whose stochastic-gradient noise has a large effect on the paper's loss bound receive larger batches, with the weighting determined by the future learning-rate tail rather than by a hand-designed warmup or cooldown rule.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace the unresolved small jumps of an infinite-activity stable Levy noise source in a neural SDE or stochastic optimizer with one Gaussian increment whose variance equals the discarded jump variance. Simulate only jumps above the cutoff exactly or by Poisson sampling, retaining the large-jump distribution while obtaining the paper's O(\varepsilon) Wasserstein error instead of the naive O(\varepsilon^{1-\alpha/2}) error.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Failed on benchmark
2026
Use the paper's sharp sK approximately equal to 1 phase transition to choose between conservative Fejer averaging and higher-order polynomial filtering. When the local fixed-point spectrum is separated from eigenvalue 1, use a Jackson-type filter; near the critical regime, use the safe Fejer filter instead of unrestricted Anderson extrapolation.
Useful7/10
Difficulty7/10
Novelty7/10
✗ Failed on benchmark
2026
Implement a momentum optimizer as a contact Hamiltonian splitting rather than as a direct Euler discretization. Introduce an auxiliary scalar contact state and compose exact kinetic, potential, and damping subflows; this produces a second-order conformal integrator whose modified contact energy should decay more reliably at moderately large learning rates.
Useful7/10
Difficulty5/10
Novelty7/10