让扩散模型一次生成满足多个目标的样本,效率远超传统方法。
Distributional Multi-objective Black-box Optimization for Diffusion-model Inference-time Multi-Target Generation
- 推理时通过加权重采样优化扩散过程,直接生成多目标最优样本。
- 仅需一次生成即达到基线数百次生成的超体积指标,性能显著提升。
- 可嵌入现有方法,适合分子设计等多目标生成任务。
扩散模型在学习复杂数据分布方面表现优异,已被用于高维多目标黑箱优化问题。现有方法通常采用外部优化循环(如进化算法)对扩散模型进行调优,但将扩散模型视为黑箱精炼器,忽略了其内部分布演化过程,导致效率受限。为此,我们提出推理时多目标生成(IMG)算法,在推理阶段优化扩散过程,以生成同时满足多个目标的样本。具体而言,IMG 在扩散生成过程中根据预期聚合多目标值进行加权重采样,使生成样本分布符合所需的多目标玻尔兹曼分布。我们进一步推导出该分布具有重要的对数似然解释,是分布式多目标优化问题的最优解。我们在多目标分子生成任务上实现了IMG。实验表明,IMG仅需一次生成即可获得显著高于基线算法(常需数百次生成)的超体积,且可作为优化后的扩散过程集成到现有方法中以进一步提升性能。
原文摘要 · Abstract (English)
Diffusion models have been successful in learning complex data distributions. This capability has driven their application to high-dimensional multi-objective black-box optimization problem. Existing approaches often employ an external optimization loop, such as an evolutionary algorithm, to the diffusion model. However, these approaches treat the diffusion model as a black-box refiner, which overlooks the internal distribution transition of the diffusion generation process, limiting their efficiency. To address these challenges, we propose the Inference-time Multi-target Generation (IMG) algorithm, which optimizes the diffusion process at inference-time to generate samples that simultaneously satisfy multiple objectives. Specifically, our IMG performs weighted resampling during the diffusion generation process according to the expected aggregated multi-objective values. This weighted resampling strategy ensures the diffusion-generated samples are distributed according to our desired multi-target Boltzmann distribution. We further derive that the multi-target Boltzmann distribution has an interesting log-likelihood interpretation, where it is the optimal solution to the distributional multi-objective optimization problem. We implemented IMG for a multi-objective molecule generation task. Experiments show that IMG, requiring only a single generation pass, achieves a significantly higher hypervolume than baseline optimization algorithms that often require hundreds of diffusion generations. Notably, our algorithm can be viewed as an optimized diffusion process and can be integrated into existing methods to further improve their performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。