Multi-Fidelity Bayesian Optimization With Across-Task Transferable Max-Value Entropy Search
<|reference_start|>Multi-Fidelity Bayesian Optimization With Across-Task Transferable Max-Value Entropy Search: In many applications, ranging from logistics to engineering, a designer is faced with a sequence of optimization tasks for which the objectives are in the form of black-box functions that are costly to evaluate. Furthermore, higher-fidelity evaluations of the optimization objectives often entail a larger cost. Existing multi-fidelity black-box optimization strategies select candidate solutions and fidelity levels with the goal of maximizing the information about the optimal value or the optimal solution for the current task. Assuming that successive optimization tasks are related, this paper introduces a novel information-theoretic acquisition function that balances the need to acquire information about the current task with the goal of collecting information transferable to future tasks. The proposed method transfers across tasks distributions over parameters of a Gaussian process surrogate model by implementing particle-based variational Bayesian updates. Theoretical insights based on the analysis of the expected regret substantiate the benefits of acquiring transferable knowledge across tasks. Furthermore, experimental results across synthetic and real-world examples reveal that the proposed acquisition strategy that caters to future tasks can significantly improve the optimization efficiency as soon as a sufficient number of tasks is processed.<|reference_end|>
@article{zhang2024multi-fidelity,
    title={Multi-Fidelity Bayesian Optimization With Across-Task Transferable
  Max-Value Entropy Search},
    author={Yunchuan Zhang, Sangwoo Park, Osvaldo Simeone},
    journal={arXiv preprint arXiv:2403.09570},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.09570},
    primaryClass={cs.LG cs.IT eess.SP math.IT}
}