English

VASR: Variance-Aware Systematic Resampling for Reward-Guided Diffusion

Artificial Intelligence 2026-05-13 v2

Abstract

Sequential Monte Carlo (SMC) samplers for reward-guided diffusion models often suffer from rapid lineage collapse: a few high-reward particles dominate the population within a handful of resampling steps, destroying diversity and degrading sample quality. We propose a variance-decomposition framework for reward-guided diffusion SMC that separates continuation variance VtcontV_t^{\mathrm{cont}} from residual variance VtresV_t^{\mathrm{res}}, revealing that high offspring-count variance under the commonly used multinomial resampling drives this collapse. This motivates \textsc{VASR} (Variance-Aware Systematic Resampling), which addresses both variance terms via variance-optimal mass allocation mtwtertm_t \propto w_t e^{r_t} (minimizing VtcontV_t^{\mathrm{cont}}) and systematic resampling (controlling VtresV_t^{\mathrm{res}}). For latent diffusion models where intermediate rewards are noisy due to stochastic continuations, we propose \textsc{VASR-Max}, a deliberately biased high-selection variant for variance-sensitive reward optimization. Both methods are training-free, fully parallelizable, and add only linear overhead. On MNIST and CIFAR-10, VASR achieves as high as 26%26\% better FID than prior SMC methods while remaining 66 times faster than MCTS-based value methods at matched compute. On text-to-image generation, \textsc{VASR-Max} consistently outperforms the strongest SMC baseline across compute budgets and matches MCTS-based methods within 2.5--3% reward at high budgets while being approximately times faster.

Keywords

Cite

@article{arxiv.2604.06779,
  title  = {VASR: Variance-Aware Systematic Resampling for Reward-Guided Diffusion},
  author = {Shivanshu Shekhar and Sagnik Mukherjee and Jia Yi Zhang and Tong Zhang},
  journal= {arXiv preprint arXiv:2604.06779},
  year   = {2026}
}
R2 v1 2026-07-01T11:58:48.684Z