△ 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 failed
2026
Replace the unconstrained transition of a recurrent or state-space neural network with a DMDc-initialized linear latent transition plus a learned nonlinear residual. Estimate the transition from a short warm-up dataset using Hankel delay coordinates, retain eigenmodes with decay rates near the unit circle for long-term memory, and let the neural residual model dynamics not explained by the linear backbone. This should make long-horizon prediction and slowly varying signals easier to learn while…
Useful7/10
Difficulty5/10
Novelty6/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 a weight-tied residual or neural-ODE stepper with an explicit Runge–Kutta method satisfying the reused-last-stage conditions. The final derivative is evaluated at the exact endpoint and becomes the first derivative of the next step, saving one expensive neural-vector-field call per step while preserving the designed integration order.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Replace dense coarse-to-fine cross-attention at multiresolution interfaces with a sparse, nonnegative overlap operator whose weighted feature average is exactly conserved between the two resolutions. Use this operator as a low-order path and blend it with an unrestricted neural cross-attention path through a convex limiter that keeps features inside a box or simplex domain. The construction is especially suitable for adaptive token grids, hierarchical graph neural networks, neural operators…
Useful7/10
Difficulty5/10
Novelty8/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
✗ Failed on benchmark
2026
Use the paper's parameterized invariant-torus residual and pseudo-arclength Newton correction to train a neural ODE across a continuous family of latent dynamical regimes. The continuation constraint allows the solver to pass through saddle-node folds, where stepping a physical control parameter alone would fail or jump to a different branch.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Attach a query-specific error certificate to a mesh-based PINN by applying the discrete PDE operator to the network's compatible finite-element reconstruction. For each query point, solve one adjoint system whose sensitivity-weighted residual gives the exact signed error relative to the discrete target, while norm bounds and a discretization estimator produce an interval when exact correction is unavailable. The same sensitivity scores can be fed back into collocation-point selection.
Useful7/10
Difficulty5/10
Novelty8/10
✗ Mechanism failed
2026
Replace a learned binary MoE gate with a hyperplane whose two sides contain prescribed proportions of several token populations simultaneously. In a low-dimensional routing projection, solve the cap-volume equations directly, producing deterministic per-population load control without an auxiliary load-balancing loss. Recursively applying the construction yields a balanced binary expert tree.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace several fixed message-passing layers with an implicit graph layer whose state is the solution of a nonlinear flow equilibrium. Learn monotone edge laws from endpoint features, solve for node potentials with damped chord-Newton steps, and use the resulting edge flows or potentials as the layer output. Monotonicity and the Laplacian Jacobian provide a principled stability mechanism while retaining sparse graph computation.
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace the usual gradient-descent or conjugate-gradient data-fidelity step in an unrolled reconstruction network with an exact Woodbury proximal layer for grouped multiplexed measurements. The layer can be inserted between learned denoising blocks and should provide stronger measurement consistency at a fixed number of unrolled stages, while avoiding inner iterative linear solves.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace soft boundary penalties in neural operators with a hard projection onto a finite-dimensional span of homogeneous Dirichlet Laplacian eigenfunctions. Every projected hidden field is identically zero on the boundary, while increasing the number of retained eigenfunctions recovers the expressive capacity needed for operator approximation.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace conventional nested bilevel optimization with simultaneous primal-dual updates that enforce inner-model stationarity through a Lagrange multiplier. Add quadratic dual regularization and projection onto a bounded ball, while estimating all Hessian-vector terms using finite differences of ordinary gradients.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Replace ordinary momentum with a semi-implicit velocity update containing viscous damping and a proximal dry-friction step, while evaluating the gradient at a look-ahead parameter point. The dry-friction proximal operator exactly zeros sufficiently small velocities, which may suppress late-training oscillations and create finite-time stationarity instead of merely asymptotic velocity decay.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Train on a sequence of Jin–Xin relaxation problems with decreasing relaxation width rather than training immediately on the singular conservation law. The network predicts both the conserved state and an auxiliary flux, and each stage is initialized from the previous stage so that the learned shock profile sharpens gradually.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Replace an explicit Euler residual update for a skew-coupled hidden state with a five-stage palindromic composition of exact shear maps. Use a=1/4, the unique real coefficient maximizing the analyzed spectral CFL interval, and adapt the step size from an estimate of the learned coupling operator's spectral norm.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Use Adam normally, but periodically estimate the spectrum of the Adam-preconditioned Hessian and add a damped low-rank Newton correction when the preconditioned curvature is strongly ill-conditioned or the gradient is concentrated in flat directions. The correction is computed only in a small Lanczos subspace, so the method targets cross-coupled ill-conditioning without materializing or inverting the full Hessian.
Useful7/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use a Sylvester equation as an implicit parameterization of a recurrent or state-space transition matrix, while regularizing the actual solution X rather than only the coefficient matrices A and B. The key mechanism is to suppress small singular values of X and near-resonant eigenvalue pairs, which otherwise amplify selected components of the learned transition.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent an intermediate hidden-state matrix as a low-rank factorization and replace a dense residual update by a repeated contractive step followed by hard SVD truncation. Increase or decrease the rank automatically so that the discarded Frobenius-norm tail is below a specified tolerance, providing an explicit accuracy-memory tradeoff instead of fixing the rank in advance.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace isotropic neighbor aggregation in a graph or point-cloud neural network with a local anisotropic diffusion operator determined by empirical first and second moments of each neighborhood. Subtract the first-moment drift before aggregation, and use the normalized second-moment tensor to mix feature derivatives along the locally supported directions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary adversarial training over a fixed perturbation set with adaptive robust training in which the admissible perturbations depend on the current network state. Train on a small active set of hard scenarios, then search for a newly admissible scenario with larger loss or constraint violation and add it only when needed. This should reduce redundant adversarial examples while targeting worst-case regions induced by the current model.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a standard recurrent or neural-CDE Euler transition with a second-order rough transition that receives both first-order increments of the input path and learned second-order branched increments. Unlike a geometric signature block, the second-order coefficients are independent learned maps rather than being forced to equal derivatives or shuffle-symmetric combinations of first-order vector fields, allowing the model to represent order-sensitive and non-geometric interactions in irregular…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unrolled constrained inner optimization in a meta-learning or hyperparameter-learning system with a KKT-based single-level layer. Instead of imposing primal-dual complementarity exactly from the first iteration, solve a sequence of relaxed problems with decreasing complementarity tolerances, making early optimization smoother and reducing failures caused by degenerate active-set geometry.
Useful6/10
Difficulty6/10
Novelty4/10