✓✓ Beats tuned baseline
2026
Use the noisy diffusion state to estimate posterior probabilities over data clusters, then route the denoising computation to one or a few cluster-specific score experts. Each expert stores a low-rank covariance or low-rank score correction, so after posterior commitment the denoiser operates at the cluster intrinsic dimension rather than ambient dimension. During the early mixing phase, retain a shared full-dimensional score or evaluate a small weighted set of experts.
Useful8/10
Difficulty6/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Modify a diffusion or score-based sampler so that boundary reflection is aligned with the model's admissible noise and control directions instead of using the Euclidean normal. At a boundary hit, reflect through the sub-Riemannian diffusion Gram matrix, preserving the anisotropic dynamics and preventing constraint corrections from injecting motion into inaccessible directions.
Useful8/10
Difficulty4/10
Novelty7/10
✗ Failed on benchmark
2026
Group W consecutive diffusion or flow-model loss terms and approximate every intermediate parameter Jacobian by a time-weighted interpolation of the Jacobians at the group’s two endpoints. Sum the intermediate upstream signals into two endpoint cotangents, then perform only two full DiT backward passes instead of W. Add a cosine-similarity gate comparing predicted and actual intermediate velocity changes so that groups violating the local-linearity assumption use exact backpropagation.
Useful8/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained trajectory or density network with a stack of RealNVP-style triangular coupling layers whose inverse and log-volume change are analytic. Condition the coupling subnetworks on the task prompt and time, so the same invertible module represents task-specific population states while providing an exactly computable density and score surrogate.
Useful7/10
Difficulty5/10
Novelty4/10
✓✓ Beats tuned baseline
2026
Represent both endpoint distributions as Gaussian mixtures and explicitly transport their component labels along with continuous states. Use an entropic coupling between source and target components, then run a separate Gaussian bridge for every selected component pair, with covariance inflation preventing unstable Riccati or Cholesky computations.
Useful7/10
Difficulty6/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Split a neural ODE or diffusion-model probability-flow ODE into a stiff known smoothing operator, a learned drift, and an optional local reaction term. Use super-time-stepping stages for the smoothing operator inside a single macrostep, while evaluating the learned drift only at selected coupling stages and treating the local reaction with diagonal or block-local implicit solves. This should allow substantially larger stable macrosteps when the known operator has a large negative spectral…
Useful7/10
Difficulty6/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Train one denoiser only for the nonquadratic residual distribution, then modify the diffusion sampler using an analytically computed quadratic Gaussian context. Changing $K$ at inference changes the target distribution without retraining the denoiser, enabling transfer across temperatures, masses, coupling strengths, and boundary conditions whenever those changes remain quadratic.
Useful7/10
Difficulty6/10
Novelty6/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
Unverified
2026
For a neural stochastic state-space model or discrete diffusion sampler, monitor whether learned transition logits admit a global scalar potential on the active latent manifold. Penalize residual cycle affinities in the conditional sector, but leave reset cycles unpenalized so the model can retain useful dissipative mixing. The distinctive prediction is a linear decrease of integrability error with residual cycle current and a quadratic decrease of entropy production near autonomous…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace or augment the coordinate embedding of a neural operator, PINN, or coordinate MLP with Chebyshev features plus rational features whose poles are selected by the AAA rational approximation algorithm. The rational features should represent boundary layers and other localized singular structures with fewer channels than a high-degree polynomial basis, reducing Gibbs-like oscillations and improving accuracy at small diffusion-to-advection ratios.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a long sequence of graph propagation steps used to approximate a spectral graph filter with one block Krylov projection. Construct a basis from the input node features together with a small number of Gaussian probe vectors, evaluate the desired matrix function only on the resulting small projected matrix, and retain the output columns corresponding to the original features.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a finite-basis drift loss whose probes are selected to make the observation matrix well-conditioned, so the generator cannot hide distribution mismatch in directions invisible to the interaction field. Use the smallest singular value of the probe operator as a training-time observability score and abstain from interpreting the drift when that score is too small.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace unconstrained low-rank compression of a neural state with an augmented basis that always contains vectors representing known conserved quantities or diagnostically important linear statistics. After each learned transition, project the state back onto the affine constraint set with an exact minimum-norm correction, preventing rank truncation and model error from accumulating in those statistics.
Useful6/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace the standard plug-in KSD V-statistic with the positive-part square root of the unbiased pairwise U-statistic when evaluating or training a sampler against a fixed target score. The estimator uses off-diagonal cancellation and should approach the Hilbert–Schmidt fluctuation scale instead of the larger trace scale paid by the diagonal-including V-statistic.
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Compress a module whose output changes with a scalar condition such as diffusion time, temperature, or compute budget by representing its response in a low-rank basis generated by resolvent-like functions. Distinct spectral modes produce rational factors \((1-\tau\lambda_k)^{-1}\), allowing a small number of learned components to approximate a large hypernetwork or condition-dependent parameter table.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use the squarefree cycle polynomial as a structural loss for graph autoencoders, graph generators, or graph distillation. Penalize mismatch between input and reconstructed or generated graphs in weighted simple-cycle totals, preventing models from matching degree and edge statistics while destroying higher-order loop structure.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Constrain the local stochastic dimension of neural hidden-state trajectories using covariance of residual increments rather than raw second moments. A local mean estimate removes predictable drift, so the regularizer targets genuinely independent noise or latent-factor directions and can encourage compact diffusion or state-space representations.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a two-output anti-collapse regularizer based on the determinant of the Jacobian Gram matrix, together with a penalty against proportional highest-degree coefficient tensors. The paper's inequality predicts that preserving coefficient non-proportionality prevents the output distribution from concentrating on thin curves or tiny regions, potentially improving coverage of a two-dimensional latent or generative output.
Useful4/10
Difficulty5/10
Novelty6/10