arXiv Machine Learning By Peizhuo Li, Emre Aksan, Alexandru-Eugen Ichim, Thabo Beeler, Olga Sorkine-Hornung

Diversify Diffusion with Temperature Sampling and Variance-Corrective Time Shifting

Read the original on arXiv Machine Learning →

arXiv:2607. 10853v1 Announce Type: cross Abstract: Diffusion models faithfully reproduce their training distribution, but also inherit its imbalances and leave rare or under-represented modes hard to reach.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
23h ago

Specificity-Aware Diffusion Steering via Variance-Reduced Sequential Monte Carlo

The paper introduces a method for specificity‑aware diffusion steering that suppresses undesired samples while preserving desired ones. By formulating the problem as a target‑design task, it derives a time‑dependent target distribution based on overlap between positive and negative reference distributions, and samples from it using a variance‑reduced Sequential Monte Carlo (SMC) sampler. Experiments on synthetic, class‑contrastive, text‑to‑image, and peptide‑MHC tasks demonstrate reduced mode shift, improved sampling stability, and better suppression of undesired regions compared to negative‑guidance baselines.

By Luran Wang, Linrui Ma, Hannes St\"ark, Regina Barzilay
arXiv Statistics ML
Sep 4

Markov Chain Monte Carlo with Diffusion Paths

The paper introduces a new Markov chain Monte Carlo method that samples from multimodal distributions by interpolating along the diffusion path of a noising diffusion process, preserving mode weights and improving mixing. It proposes a Metropolis-adjusted diffusion path (MAD-Path) sampler that corrects for bias from approximate score estimates and discretization errors, ensuring the target distribution remains invariant. Experiments on Bayesian posteriors demonstrate that MAD-Path outperforms tempering-based MCMC and unadjusted diffusion samplers in global exploration and accurate mode-weight estimation.

By Han Chen, Sifan Liu, Jun Yang
arXiv Machine Learning
Aug 28

GRAS: Guided Reduced-Variance Proposals and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion

The paper introduces GRAS, a method that improves training‑free reward alignment for discrete diffusion models by reducing variance in guided proposals and adapting the resampling temperature during search. It achieves this without adding denoiser cost, using Rao‑Blackwellized estimates for differentiable rewards and a leave‑one‑out baseline for non‑differentiable ones. Experiments on regulatory DNA and protein design show GRAS outperforms existing training‑free techniques and rivals reward‑fine‑tuned models.

By Kwanyoung Kim