We study the novel problem of blackbox optimization of multiple objectives
via multi-fidelity function evaluations that vary in the amount of resources
consumed and their accuracy. The overall goal is to approximate the true Pareto
set of solutions by minimizing the resources consumed for function evaluations.
For example, in power system design optimization, we need to find designs that
trade-off cost, size, efficiency, and thermal tolerance using multi-fidelity
simulators for design evaluations. In this paper, we propose a novel approach
referred as Multi-Fidelity Output Space Entropy Search for Multi-objective
Optimization (MF-OSEMO) to solve this problem. The key idea is to select the
sequence of candidate input and fidelity-vector pairs that maximize the
information gained about the true Pareto front per unit resource cost. Our
experiments on several synthetic and real-world benchmark problems show that
MF-OSEMO, with both approximations, significantly improves over the
state-of-the-art single-fidelity algorithms for multi-objective optimization.

本文研究了多目标黑盒优化的新问题，通过以不同资源消耗和准确性变化的多重保真度函数评估来减少资源消耗，以近似真实的帕累托解集合。 提出了一个称为 MF-OSEMO 的新方法来解决这个问题，并在几个综合性和真实基准问题上进行实验，表明 MF-OSEMO 相对于单一忠实算法在多目标优化上有显著改进。