Long-run Behaviour of Multi-fidelity Bayesian Optimisation

Gbetondji J-S Dovonon, Jakob Zeitler
12/19/2023
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

Multi-fidelity Bayesian Optimisation (MFBO) has been shown to generally converge faster than single-fidelity Bayesian Optimisation (SFBO) (Poloczek et al. (2017)). Inspired by recent benchmark papers, we are investigating the long-run behaviour of MFBO, based on observations in the literature that it might under-perform in certain scenarios (Mikkola et al. (2023), Eggensperger et al. (2021)). An under-performance of MBFO in the long-run could significantly undermine its application to many research tasks, especially when we are not able to identify when the under-performance begins. We create a simple benchmark study, showcase empirical results and discuss scenarios and possible reasons of under-performance.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dovonon2023longrun,
  title  = {Long-run Behaviour of Multi-fidelity Bayesian Optimisation},
  author = {Gbetondji J-S Dovonon and Jakob Zeitler},
  year   = {2023},
  eprint = {2312.12633},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.12633v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.12633.svg)](https://codeofpaper.com/paper/2312.12633)

Discussion