Preprint10.48550/arxiv.2405.08674
Expensive Multi-Objective Bayesian Optimization Based on Diffusion Models
Bingdong Li,Zixiang Di,Yi Lu,Hao Qian,Feng Wang,Peng Yang,K. T. Tang,Aimin Zhou +7 more
- 14 May 2024
TL;DR: Expensive multi-objective Bayesian optimization based on diffusion models effectively models complex distributions of Pareto optimal solutions, improving the accuracy of the obtained solution set.
read more
Abstract: Multi-objective Bayesian optimization (MOBO) has shown promising performance on various expensive multi-objective optimization problems (EMOPs). However, effectively modeling complex distributions of the Pareto optimal solutions is difficult with limited function evaluations. Existing Pareto set learning algorithms may exhibit considerable instability in such expensive scenarios, leading to significant deviations between the obtained solution set and the Pareto set (PS). In this paper, we propose a novel Composite Diffusion Model based Pareto Set Learning algorithm, namely CDM-PSL, for expensive MOBO. CDM-PSL includes both unconditional and conditional diffusion model for generating high-quality samples. Besides, we introduce an information entropy based weighting method to balance different objectives of EMOPs. This method is integrated with the guiding strategy, ensuring that all the objectives are appropriately balanced and given due consideration during the optimization process; Extensive experimental results on both synthetic benchmarks and real-world problems demonstrates that our proposed algorithm attains superior performance compared with various state-of-the-art MOBO algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Figure 8. The objective values of newly generated solutions obtained by GA’s SBX method, UG, CG and GM. (d = 20, FE = 25) 
Figure 9. The HV results of CDM-PSL and GM (d = 20). 
Figure 14. Approximate Pareto fronts obtained by CDM-PSL in real-word problems. (d = 20, FE = 100) 
Figure 5. The HV values relative to the number of FEs for CDMPSL with different number of steps t. 
Table 3. Description of real-world application problems we used in this work. 
Table 2. Characteristics of the synthetic benchmark problems.
References
•Posted Content
Denoising Diffusion Probabilistic Models
TL;DR: High quality image synthesis results are presented using diffusion probabilistic models, a class of latent variable models inspired by considerations from nonequilibrium thermodynamics, which naturally admit a progressive lossy decompression scheme that can be interpreted as a generalization of autoregressive decoding.
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Eckart Zitzler,Lothar Thiele +1 more
TL;DR: The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
8.6K
•Proceedings Article
Practical Bayesian Optimization of Machine Learning Algorithms
Jasper Snoek,Hugo Larochelle,Ryan P. Adams +2 more
- 03 Dec 2012
TL;DR: This work describes new algorithms that take into account the variable cost of learning algorithm experiments and that can leverage the presence of multiple cores for parallel experimentation and shows that these proposed algorithms improve on previous automatic procedures and can reach or surpass human expert-level optimization for many algorithms.
•Proceedings Article
Algorithms for Hyper-Parameter Optimization
James Bergstra,Rémi Bardenet,Yoshua Bengio,Balázs Kégl +3 more
- 12 Dec 2011
TL;DR: This work contributes novel techniques for making response surface models P(y|x) in which many elements of hyper-parameter assignment (x) are known to be irrelevant given particular values of other elements.
•Posted Content
Deep Unsupervised Learning using Nonequilibrium Thermodynamics
TL;DR: This work develops an approach to systematically and slowly destroy structure in a data distribution through an iterative forward diffusion process, then learns a reverse diffusion process that restores structure in data, yielding a highly flexible and tractable generative model of the data.