△ Mechanism confirmed, baseline not beaten
2026
Replace the dense hidden-state trajectory of a continuous-depth or recurrent neural block by a rank-r factorization F(t) = X(t) S(t) V(t)^T, and evolve the factors with a reversible projector-splitting integrator. During backpropagation, reconstruct earlier hidden states by reversing the factor updates rather than storing all activations.
Useful8/10
Difficulty7/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Build a latent continuous-time neural model with dynamics \(\dot{z}=Az+f_\phi(z)\), where \(f_\phi\) is known, separately computed, or frozen, and \(A\) is learned exclusively from the derivative residual after subtracting \(f_\phi(z)\). Parameterize \(A\) with a truncated SVD or low-rank factorization so its eigenvalues directly predict local stability and long-horizon growth.
Useful8/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace one neural ODE trained over the entire rollout with a sequence of locally trained vector fields, and reset each window from the observed or teacher state during training. Choose the next window boundary at the first time the current model's supervised flow error exceeds a tolerance, so difficult portions receive shorter windows and more parameters while easy portions use longer windows.
Useful8/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Compress the matrix gradient or momentum before applying Muon's polar LMO, and maintain an error residual in the uncompressed gradient space. The residual prevents systematic sign quantization bias from accumulating, unlike error feedback applied after the nonlinear polar/sign operation. This is suitable for distributed training because workers communicate one sign bit per matrix entry while the server still applies a matrix-aware Muon step.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace full-state quantized write-back in a deep low-bit residual stack with quantized increment error feedback. The residual branch quantizes the proposed increment after adding the previous carry, while the carry stores the exact discrepancy; this makes the total error telescope instead of accumulating approximately once per layer.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Attach a hard control-barrier-function quadratic-program safety filter to a neural policy, but solve the filter with operator splitting and differentiate through its fixed-point map using projection Jacobian-vector products. The network learns the nominal action and task objective end to end, while the deployed action remains the feasible filtered action rather than an unconstrained penalty-based approximation.
Useful8/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace pointwise high-order PINN residuals with a stochastic one-step residual evaluated on Brownian transitions. A single scalar network produces the value, gradient, and Hessian by automatic differentiation, and the quadratic centered increment supplies a stochastic probe of the Hessian. Add a terminal gradient penalty so the learned full jet is constrained at the terminal boundary, not only the scalar value.
Useful8/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Train a neural trial function for an elliptic PDE using a very-weak residual in which all derivatives act on fixed smooth test functions rather than on the neural network. This eliminates second-order reverse-mode or forward-mode automatic differentiation and allows low-regularity activations while retaining a least-squares objective over many test functions.
Useful8/10
Difficulty4/10
Novelty6/10
✗ Mechanism failed
2026
Run an adaptive neural ODE solver once to determine accepted step sizes, then train using a regular fixed-length replay of those steps rather than differentiating through adaptive accept/reject logic. The replay can be fused across a batch of trajectories and differentiated with an ordinary reverse sweep, giving the exact discrete gradient of the replayed solver and predictable GPU work.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural operator from frozen ambient mechanism blocks and a geometry-specific algebraic constraint adapter. The adapter parameterizes all outputs in the affine set satisfying sampled linear constraints exactly, so the network never produces boundary-violating states and does not require a penalty coefficient or post-step projection.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Apply the paper's compositional PAS idea to recurrent or state-space networks by propagating a polytope of possible hidden states and input perturbations over multiple time blocks. Instead of validating one hidden trajectory at a time, maintain a trusted convex family and re-linearize only when its nonlinear-fidelity tolerance is exceeded. This creates a runtime monitor and adaptive horizon mechanism for long-sequence inference, forecasting, and learned world models.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Represent a large linear map acting on a Cartesian 3D grid and multiple physical channels as a TT-matrix, while retaining separate TT blocks for channel couplings that have different semantics. Apply the layer by sequential contractions with TT cores rather than materializing a dense matrix or a full 3D convolution kernel. Rank truncation provides an explicit accuracy-versus-memory knob and can be applied after optimizer updates.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Mechanism failed
2026
Construct an efficient recurrent or state-space layer whose impulse response follows Mittag-Leffler relaxation instead of a single exponential. A bank of stable diagonal state channels approximates the long power-law tail, allowing the layer to retain information over widely separated timescales with only \(K\) states per feature.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Build a label-free router for a finite library of neural operators by estimating one shared physical target response from an anchor prediction and using it to rank every candidate through inner products with candidate differences. The method avoids running a full residual-based diagnostic independently for every expert and can be used either to select the best expert or to form a corrected weighted combination.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace per-particle message evaluation in a point-cloud or particle-based neural layer with exact box moments. Particles inside a box are compressed into a fixed tensor of monomial sums, and every query in that box evaluates the same piecewise-polynomial interaction from those moments, reducing work from particle-query pairs to particles plus occupied boxes.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the unstable classical derivative of a discretized rough energy component with a matched dilation quotient derived from its intrinsic scale recursion. Use this field inside kick-drift-kick proposals and apply an exact Metropolis correction, allowing the proposal field to be measurable and nonconservative rather than an exact neural-energy gradient. The experiment should test whether acceptance rates and posterior samples remain stable as the rough-energy resolution increases.
Useful7/10
Difficulty5/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Approximate the exact event-by-event lifted sampler by drawing independent Poisson jump counts over a short interval and applying compatible discrete moves in parallel. This converts sequential neighbor events into batched GPU-friendly updates while retaining the Hamiltonian rate structure; the step size controls the error-versus-throughput tradeoff.
Useful7/10
Difficulty5/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Attach a polyharmonic spline decoder to a coordinate MLP or use it as a standalone neural-field output head over a large set of spatial anchors. The decoder represents the output as a low-degree polynomial trend plus a PHS kernel expansion, while FMM evaluates all anchor-to-query interactions in approximately linear or near-linear cost. When coefficients must be fitted or periodically recalibrated, solve the constrained interpolation system with projected conjugate gradients and a sparse…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Evaluate weak residuals against a bank of periodic trigonometric test functions using FFT projections instead of repeated pointwise quadrature or output automatic differentiation. Frequency truncation and mode weighting provide a direct way to control the spatial scales enforced during neural PDE training.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Train a neural network to represent an elliptic solution using Walk-on-Spheres rollouts as stochastic targets instead of evaluating a mesh-based PDE residual. For each input point, recursively jump to a random point on the largest interior sphere, accumulate source contributions, evaluate boundary data at termination, and regress the network output to the resulting Monte Carlo estimate.
Useful7/10
Difficulty5/10
Novelty6/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
✗ Mechanism failed
2026
Embed every variable-domain sample into one fixed ambient hyperrectangle and append its signed-distance function as an additional channel to the operator input. Deterministically extend fields outside the physical domain, resample them onto a shared latent grid, apply standard Fourier layers, then interpolate and mask the output on the requested target discretization. The network learns the operator rather than a separate geometry encoder, so the same weights can be used across shapes and mesh…
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace dense continuous action search during neural-controller verification with a finite set of representative inputs induced by affine pieces of the interval neural dynamics. This makes safety checking parallel over state cells and candidate actions, enabling much cheaper certification or repeated safe-set updates.
Useful7/10
Difficulty7/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Build a reusable bank of local fine-scale correctors offline, then let a lightweight online network assemble them using the current coarse state and material context. This replaces repeatedly applying a globally expensive fine-scale model with low-dimensional coefficient modulation for parameter sweeps and autoregressive rollout.
Useful7/10
Difficulty6/10
Novelty8/10