English

Hierarchical Variational Policies for Reward-Guided Diffusion

Machine Learning 2026-05-22 v1 Artificial Intelligence Computer Vision and Pattern Recognition

Abstract

Adapting pretrained diffusion models to downstream objectives such as inverse problems often requires expensive test-time guidance or optimization. We propose a principled framework for generating high-quality reward-aligned samples at substantially reduced inference cost. Our approach formulates test-time adaptation as a hierarchical variational model, where control is amortized into a lightweight yet expressive stochastic policy. This formulation naturally supports few-step diffusion sampling: large step sizes enable fast inference, while the learned policy maintains sample quality by providing structured per-step control. The resulting fully amortized sampler achieves a strong quality--speed tradeoff, matching or exceeding recent test-time scaling baselines while requiring significantly less compute. For example, on 4x super-resolution, our method achieves better perceptual quality with more than 5x faster inference compared to the best-performing baseline. We further extend our approach to a semi-amortized regime that combines cheap amortized proposals with limited test-time optimization, achieving state-of-the-art perceptual quality across several challenging inverse problems.

Keywords

Cite

@article{arxiv.2605.21661,
  title  = {Hierarchical Variational Policies for Reward-Guided Diffusion},
  author = {Kushagra Pandey and Farrin Marouf Sofian and Jan Niklas Groeneveld and Felix Draxler and Stephan Mandt},
  journal= {arXiv preprint arXiv:2605.21661},
  year   = {2026}
}
R2 v1 2026-07-22T07:24:50.316Z