△ Mechanism confirmed, baseline not beaten
2026
Use the relaxed QFT tensor-network topology as a trainable norm-preserving mixer inside a neural block, replacing a dense token-mixing matrix or an expensive global convolution. The network learns data-adapted global interactions while retaining structured O(N log^2 N) application and an exact cheap inverse, making it suitable for image tokens, long sequences, or reversible residual blocks.
Useful7/10
Difficulty6/10
Novelty6/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
△ Mechanism confirmed, baseline not beaten
2026
Replace a single parameter iterate by two coupled replicas with unequal cross-couplings: replica 1 receives a force proportional to k_1(theta_1-theta_2), while replica 2 receives a force proportional to k_2(theta_2-theta_1), with k_1 not equal to k_2. The asymmetric coupling creates a controlled circulating component in the stochastic training dynamics, potentially helping escape flat saddles or correlated minibatch-noise traps without requiring an external periodic schedule. The coupling must…
Useful7/10
Difficulty5/10
Novelty7/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
✓✓ Beats tuned baseline
2026
Replace a dense mixing or attention matrix on tokens arranged on a Cartesian grid by a product of learned or fixed one-dimensional concentration operators. The layer applies one axis operator at a time, reducing parameter and compute cost while enforcing that the global operator is a positive contraction with controlled spectral leakage.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a conventional minibatch gradient computed from consecutive correlated samples with a coupled multilevel estimator whose fine-minus-coarse differences are evaluated on the same trajectory segment. Clip each correction and the final estimator to a certified or empirically estimated norm bound. The estimator should be most useful in streaming reinforcement learning and time-series training, where independent minibatches cannot be obtained cheaply.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Add a controlled antisymmetric component to the local parameter update so optimization can circulate around ill-conditioned valleys instead of moving only along gradient directions. The symmetric component supplies dissipation, while the skew component produces the oscillatory non-reciprocal response predicted by the paper. Adapt the skew strength only while the estimated discrete-time dynamics remain stable.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a uniformly stepped recurrent or state-space transition with propagation measured in an effective clock that may pause on intervals and make finite jumps at events. Use an implicit Stieltjes-Euler residual for every interval and event, then differentiate that exact residual with a reverse discrete adjoint. This should provide stable long inactive periods, exact scheduled resets, and fewer computational steps than approximating instantaneous events with many tiny chronological-time steps.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build an implicit or unrolled graph neural operator on a symmetric simplicial mesh, and perform every symmetry-compatible linear solve in a fixed representation-theoretic basis rather than the original edge/face basis. The same basis can be reused for Poisson, Maxwell, diffusion, and learned linear combinations of DEC operators, yielding parallel independent blocks and lower peak memory without changing the discretized solution.
Useful7/10
Difficulty6/10
Novelty6/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
△ Mechanism confirmed, baseline not beaten
2026
Replace explicit Runge-Kutta integration in a neural ODE or probability-flow ODE sampler with the anchored two-derivative method. Each stage uses both the neural vector field and its total time derivative, while the coupled implicit solve is designed so the accepted map has an L-stable Padé stability function. The method should allow larger steps on stiff trajectories without amplifying fast decaying modes.
Useful7/10
Difficulty7/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the inner step of a neural optimizer with a safeguarded cubic local-model solve. Represent the cubic Taylor model as a homogeneous tensor in an augmented coordinate, solve proximal unit-sphere subproblems by alternating tensor contractions, decode a candidate step, and accept it only when the actual neural loss confirms the predicted decrease.
Useful7/10
Difficulty7/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace constant decoupled weight decay with a coefficient proportional to the current learning rate divided by the peak learning rate. The optimizer applies ordinary decay at the learning-rate peak but weakens decay during cooldown and late training, preventing unnecessary steady-state parameter-norm shrinkage while retaining early-training stabilization.
Useful7/10
Difficulty2/10
Novelty6/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
✗ Failed on benchmark
2026
Replace generic learning-rate selection in decentralized or federated gradient tracking with a low-dimensional minimax search over the exact scalar-mode pole radius. The optimizer chooses the step size that minimizes the worst predicted contraction over the observed graph spectrum and an estimated curvature interval, rather than relying only on conservative global bounds.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use computable upper and lower error bounds to reject quantized-depth configurations that cannot reach the desired accuracy before training. The planner separates irreducible library mismatch from finite-depth synthesis, codebook metadata, and execution errors, then selects the smallest depth and metadata budget whose estimated bound passes the target.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a jointly optimized scalar electrostatic potential in a neural PDE solver with a dual flux represented by a Hodge curl correction. The resulting inner problem is a positive quadratic minimization with the divergence constraint satisfied exactly, avoiding unstable primal-dual training dynamics.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Use a learned quasipotential barrier as feedback for optimizer noise and restart control. Increase stochasticity when training is trapped in a high-loss metastable basin and reduce it near a desirable basin, with switching thresholds determined by the estimated barrier rather than by a fixed patience schedule.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace dense attention between tokens on opposite sides of a one-dimensional boundary or segment split with a dyadic low-rank approximation of a Cauchy/Hankel distance kernel. Each distance-scale block uses O(log(1/\varepsilon)) features, and the number of active scales grows only logarithmically with context length after discarding a narrow boundary layer. This is especially suitable for a relative-position attention branch or state-space-like long-range branch, rather than arbitrary…
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace independently restarted proximal-gradient or quasi-Newton solves for a composite neural objective with a curvature-recycling Douglas–Rachford loop. The previous proximal state, residual, and limited-memory BFGS curvature pairs are transported to the next proximal center, reducing expensive loss and gradient evaluations while retaining the cheap nonsmooth proximal operation.
Useful7/10
Difficulty5/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace a fixed SGD learning rate with a per-update step selected from the positive curvature observed along the proposed direction. The controller estimates the directional Taylor remainder using one or two function evaluations, increases the step when the observed direction is benign, and backtracks only when the update fails a sufficient-decrease test.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a single optimizer trajectory by N parameter particles and optimize the time until the first particle reaches a target loss or reward threshold. Use distinct interaction regimes: bounded normalized interactions should provide only the usual logarithmic extreme-search improvement, whereas unnormalized coherent force accumulation and stochastic pairwise kicks should produce distinct 1/N and 1/(N ln N) first-hit laws.
Useful7/10
Difficulty5/10
Novelty7/10