Diffusion models have shown promising generative capabilities across diverse domains, yet aligning their outputs with desired reward functions remains a challenge, particularly in cases where reward functions are non-differentiable. Some gradient-free guidance methods have been developed, but they often struggle to achieve optimal inference-time alignment. In this work, we newly frame inference-time alignment in diffusion as a search problem and propose Dynamic Search for Diffusion (DSearch), which subsamples from denoising processes and approximates intermediate node rewards. It also dynamically adjusts beam width and tree expansion to efficiently explore high-reward generations. To refine intermediate decisions, DSearch incorporates adaptive scheduling based on noise levels and a lookahead heuristic function. We validate DSearch across multiple domains, including biological sequence design, molecular optimization, and image generation, demonstrating superior reward optimization compared to existing approaches.
View on arXiv@article{li2025_2503.02039,
title={ Dynamic Search for Inference-Time Alignment in Diffusion Models },
author={ Xiner Li and Masatoshi Uehara and Xingyu Su and Gabriele Scalia and Tommaso Biancalani and Aviv Regev and Sergey Levine and Shuiwang Ji },
journal={arXiv preprint arXiv:2503.02039},
year={ 2025 }
}