✓✓ 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
✓✓ Beats tuned baseline
2026
Replace full-state prediction in a neural simulator or neural operator with prediction of a perturbation around a cheap structured background trajectory. Compute the background defect and known linearized or nonlinear corrections explicitly, and let the neural closure model only the remaining residual. Add a residual-magnitude gate so the learned closure is suppressed when the structured solver already explains the target dynamics.
Useful8/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace the standard Gaussian affine reverse step with a conditional transport kernel learned from the forward transition. Given a noisy state x_{k+1}, the model predicts a full conditional distribution for x_k using a monotone conditional CDF or an autoregressive normalizing flow. This represents multimodal and state-dependent reverse transitions that cannot be captured by a single Gaussian mean and variance.
Useful8/10
Difficulty6/10
Novelty5/10
✓✓ Beats tuned baseline
2026
Train a categorical denoiser for the clean token but convert its output analytically into the reverse CTMC jump rates using the exact forward transition kernel. This separates the easy-to-learn clean-token posterior from the quantity required by the reverse process and should keep the uniform-diffusion ELBO finite at initialization, unlike direct denoiser substitution.
Useful8/10
Difficulty4/10
Novelty7/10
✓✓ Beats tuned baseline
2026
Replace IID latent or diffusion-noise samples used inside a neural expectation with a randomized low-discrepancy point set. Each randomized point has the correct marginal distribution, while the complete set covers the sampling domain more uniformly, reducing variance in minibatch loss and gradient estimates when the integrand is smooth in the base-noise coordinates.
Useful7/10
Difficulty4/10
Novelty6/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
Use an entropy-production-inspired local discrepancy between full-step and coupled half-step reverse diffusion trajectories as an adaptive error signal. The sampler takes large Euler steps where the estimated marginal mismatch is small and refines only where score variation or reverse-flow mismatch is high, targeting terminal KL rather than path-space error.
Useful7/10
Difficulty5/10
Novelty6/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 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
✓✓ Beats tuned baseline
2026
Replace uniformly spaced diffusion timesteps with a grid whose intervals contribute equal area under the local information-loss curve. The sampler then takes smaller steps in noise regions where the denoiser contributes most to likelihood and larger steps in low-information regions.
Useful7/10
Difficulty4/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