Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.11533 v2 pith:EAXVM46H submitted 2023-02-22 cs.LG

classification cs.LG
keywords optimisationbayesianfunctionssmoothblack-boxcostsmethodsmongoose
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools