△ Mechanism confirmed, baseline not beaten
2026
Build a Schrödinger-bridge solver that represents the two Sinkhorn scaling factors as solutions of forward and backward Kolmogorov PDEs, rather than requiring explicit transition-density evaluation. Enforce an oblique Neumann condition on the backward factor and a normal no-flux condition on the forward factor, allowing degenerate diffusion and hard domain boundaries to be handled directly.
Useful7/10
Difficulty7/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace additive Euclidean stochastic residual updates with tangent-space updates followed by the Riemannian exponential map. A neural drift network produces a tangent vector, while noise is sampled using the metric induced by the inverse diffusion tensor; the resulting layer is invariant to smooth coordinate reparameterizations up to numerical integration error.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's localized truncation residual as an online certificate for whether the current polynomial lift is expressive enough. Start with a low-degree edge lift and activate additional degree blocks or a learned closure only when the residual exceeds a calibrated threshold, avoiding the cost and instability of always using a large polynomial dictionary.
Useful7/10
Difficulty4/10
Novelty8/10
✗ Failed on benchmark
2026
Split hidden dynamics into relaxation bands when the Jacobian spectrum has a gap, evolve each band with its own timescale, and retain an explicit cross-band exchange term. This yields a principled dual-timescale RNN or SSM rather than choosing fast and slow branches heuristically.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or state-space network together with a periodic hidden-state trajectory, then use the Fourier-domain Hill operator of its linearized dynamics to penalize positive Floquet growth rates. The method can retain algebraic hidden-state constraints, avoiding the inaccurate practice of treating a singular descriptor matrix as invertible.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Replace a stationary optimizer by a periodic two- or multi-phase schedule, such as alternating large and small learning rates, SGD and momentum, or gradients from different loss components. Stability is assessed over the complete period using the product of phase-wise linearized update maps, allowing a phase that is individually expansive to be safely combined with a contracting phase.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Build an autoencoder whose decoder outputs a monotone quantile function rather than an unconstrained spatial field. The latent representation can be compressed with POD or a neural bottleneck in CDT space, while the decoder guarantees valid transport maps and therefore avoids negative densities, mass drift, and spurious oscillations common in unconstrained reduced-order neural decoders.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the recursive errors-in-variables subspace spectrum as a controller for the width of a latent SSM rather than fixing the state dimension in advance. Neurons or state channels are added when corrected covariance eigenvalues rise above the noise floor and pruned when they remain below it, producing a model-order-adaptive recurrent architecture for nonstationary streams.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the q-fractional characteristic equation as an online trust-region controller for recurrent gain or residual-memory strength. Instead of allowing the recurrent Jacobian to cross the unit-circle boundary, estimate the dominant characteristic root and rescale the feedback gain whenever it approaches modulus one.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Fine-tune a denoiser by matching its action to a target-domain proximal operator, instead of minimizing only pixelwise denoising error. Apply the loss on the intermediate states and noise levels actually encountered by the downstream iterative solver, so the adaptation directly reduces the error that controls PnP reconstruction stability.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Train a conditional flow-matching model against a sequence of intermediate states generated by an expensive optimisation or refinement process, rather than only matching noise to the final sample. The resulting vector field should require fewer inference steps and remain closer to the solver's feasible trajectory than endpoint-only flow matching.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use contraction-aware integration rather than assuming that Euler discretization error grows monotonically with sampling time. For a contracting neural ODE, permit a transient error peak but choose the step size and terminal horizon using the predicted peak time and subsequent exponential decay.
Useful7/10
Difficulty4/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's distinction between radial attraction and tangential instability at infinity to detect impending hidden-state bursts before they cause numerical failure. When the state approaches a radially growing directional equilibrium, temporarily add radial damping or switch to a bounded fallback update, then restore the original dynamics after angular ejection.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Replace an unconstrained recurrent block with two coupled modules: a contractive perceptual estimator and an input-to-state-stable cognitive state transition. Spectral normalization and a controlled Euler residual step enforce a quantitative gain condition, preventing hidden-state explosion while retaining long memory when the contraction factor is chosen close to one.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Compress a transformer KV cache by selecting actual past tokens whose key or hidden-state columns form a stable basis for all cached tokens. Instead of retaining tokens with the largest attention scores or leverage scores independently, compute rank-revealing pivoting of the leading right-singular-vector matrix and retain its pivot columns, then evaluate attention using the representatives plus an optional low-cost residual correction.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
When a neural network is placed inside a Newton, SQP, or interior-point optimization loop, replace its ReLUs only in the embedded inference graph by a smooth algebraic approximation. The approximation is uniformly close to ReLU but has well-defined first and second derivatives, improving Hessian-based action optimization without retraining or changing the learned weights.
Useful7/10
Difficulty3/10
Novelty4/10
✓✓ Beats tuned baseline
2026
Add an exact linear-constraint projection to the output solve of a neural operator or physics-informed model. The network produces an unconstrained prediction or coefficient vector, while a small constrained least-squares layer removes the component violating known conservation laws and separately penalizes residuals that cannot be enforced exactly.
Useful7/10
Difficulty5/10
Novelty5/10
△ Mechanism confirmed, baseline not beaten
2026
Build a neural dynamical block whose hidden state contains differential variables and Lagrange multipliers, with a singular descriptor matrix enforcing constraints during propagation. This avoids the drift and ill-conditioning that can arise when exact constraints are represented only by a penalty term.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Replace repeated time-stepping of a stiff linear state-space block with a quadrature approximation to its inverse Laplace transform. The layer propagates a hidden state using a small set of complex shifted linear solves, which can be batched and reused across many time steps or parameter values.
Useful7/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace dense query-key attention with an adaptive cross approximation constructed from selected query and key pivot tokens. At each rank, choose the pivot pair that removes large estimated residual energy, update the residual by a rank-1 cross correction, and stop when the residual estimate reaches a target tolerance. The resulting factorization computes approximate attention using a small number of landmark interactions while adapting to the actual token distribution.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Mechanism failed
2026
Construct a periodic neural integral layer whose fixed singular kernel behaves like |y|^{-s} near the origin, but whose samples on the uniform grid are replaced on a small symmetric stencil by SinCoTrap correction weights. The correction cancels low-order Taylor errors caused by sampling the singularity, while all nonlocal grid points remain unchanged. Increasing the correction order from p=0 to p=1 or p=2 should reduce discretization error without increasing global grid resolution.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace ordinary low-precision multiply-add accumulation in selected neural-network reductions with a two-word floating-point accumulator updated by the paper's branch-free DW-FMA network. The high word retains the main sum and the low word stores the rounding residual, improving cancellation behavior without the control-flow divergence of conditional compensated summation.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Add a causal memory branch whose lag-response function is represented by a Bernstein polynomial with coefficients constrained to produce a nonnegative, decreasing, convex kernel. The branch aggregates past hidden states using this kernel, giving the model a learnable long-memory profile while preventing oscillatory, negative, or increasing historical influence.
Useful7/10
Difficulty4/10
Novelty7/10
✗ Mechanism failed
2026
Replace a fixed or manually scheduled learning rate with a feedback controller that estimates the critical rate of a saddle-node-like training mode and slows the schedule before the mode overshoots. The controller is applied to a low-dimensional observable of training, while ordinary gradient updates remain unchanged. It should permit aggressive learning-rate increases away from the bifurcation and automatically reduce them near a sharp stability boundary.
Useful7/10
Difficulty5/10
Novelty7/10