MONGOOSE: Path-wise Smooth Bayesian Optimisation via Meta-learning

Adam X. Yang, Laurence Aitchison, Henry B. Moss
2/22/2023
cs.LG

No confident code implementation found for this paper.

Abstract

In Bayesian optimisation, we often seek to minimise the black-box objective functions that arise in real-world physical systems. A primary contributor to the cost of evaluating such black-box objective functions is often the effort required to prepare the system for measurement. We consider a common scenario where preparation costs grow as the distance between successive evaluations increases. In this setting, smooth optimisation trajectories are preferred and the jumpy paths produced by the standard myopic (i.e.\ one-step-optimal) Bayesian optimisation methods are sub-optimal. Our algorithm, MONGOOSE, uses a meta-learnt parametric policy to generate smooth optimisation trajectories, achieving performance gains over existing methods when optimising functions with large movement costs.

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{yang2023mongoose,
  title  = {MONGOOSE: Path-wise Smooth Bayesian Optimisation via Meta-learning},
  author = {Adam X. Yang and Laurence Aitchison and Henry B. Moss},
  year   = {2023},
  eprint = {2302.11533},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.11533v2}
}

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/2302.11533.svg)](https://codeofpaper.com/paper/2302.11533)

Discussion