- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
Based on the idea that explicitly utilizing the posterior uncertainty is not always necessary in Multi-Objective Bayesian Optimization (MOBO), this study proposes a novel MOBO framework, termed PMOBO, which relies solely on the posterior mean. Unlike single-objective optimization, this approach adopts the premise that the exploration of non-dominated solutions which are guided by inter-objective trade-offs in MOBO can facilitate diverse area exploration even without explicit posterior uncertainty. Experiments using many benchmarks and real-world problems demonstrate that PMOBO achieves performance equal to or better than existing MOBO methods, regardless of the presence of noise, and further provide empirical evidence that explicitly introducing posterior uncertainty can sometimes degrade performance.
Critical strengths
-
A Simple yet Significant Idea Questioning the Necessity of Uncertainty in MOBO This work focuses on how diverse candidates are generated in multi-objective settings through inter-objective trade-offs, leading to the proposal of a method that does not explicitly use posterior variance. The research holds significant merit because it challenges the assumed necessity of utilizing uncertainty in existing MOBO methodologies.
-
Empirical Support Through Extensive Experiments The comparisons across 79 problems, conducted over 30 iterations, and evaluated under both noisy and noise-free conditions against numerous existing techniques are highly commendable. Furthermore, the validation across both Pareto-based and scalarization-based approaches—demonstrating performance degradation when posterior variance was added—suggests that this phenomenon is not limited to a single algorithm.
Critical weaknesses
-
Lack of Theoretical Analysis Regarding the Claim of Exploration Without Posterior Variance The notion that inter-objective trade-offs can generate diverse solutions does not equate to the ability to adequately explore unknown regions. Furthermore, while trade-offs can be represented using the posterior mean, they cannot fully capture epistemic uncertainty. A theoretical explanation of the conditions under which sufficient exploration is guaranteed is lacking. While not every paper needs to be backed by theoretical analysis, when proposing a new idea, a high-quality paper should ideally include an analysis of why it works, under what conditions and why it succeeds, as well as when and why it fails.
-
Limited Methodological Novelty Compared to Existing Techniques Prior studies that approximate the Pareto front using the posterior mean and Hypervolume Improvement (HVI), such as DGEMO and MOBO-OSD, already exist. Specifically, maximizing HVI over the Pareto set derived from the posterior mean is equivalent, under certain conditions, to directly maximizing HVI based solely on the posterior mean. Thus, the core novelty appears to lie not in the algorithm itself, but rather in the systematic empirical analysis concerning the necessity of posterior uncertainty.
Questions for authors
-
What are the conditions under which exploration is successful? Can sufficient exploration actually be achieved using only the posterior mean, even when the trade-offs between objectives are weak or when the Pareto set is extremely narrow? A theoretical answer to this question is required.
-
How can the mechanism of exploration be empirically verified? Beyond achieving a high Hypervolume (HV), could the methodology verify the exploration mechanism driven by trade-offs by examining the spatial distribution of selected points or by analyzing the posterior variance?
-
What is the fundamental difference from existing posterior-mean-based methods? What specific advantage does the proposed candidate generation mechanism offer compared to existing methods like DGEMO or MOBO-OSD, or compared to direct maximization of HVI using only the posterior mean?
-
What happens when non-GP surrogates are utilized? If only the posterior mean is necessary, would similar performance be achievable using predictions from methods like Radial Basis Function (RBF) interpolation or neural networks? Furthermore, how does the total computation time—including model fitting and candidate selection—compare to existing methods?
-
What is the source of superior performance in noisy settings?