Efficient Bayesian Optimization for Target Vector Estimation

Uhrenholt, A. and Jensen, B. S. (2019) Efficient Bayesian Optimization for Target Vector Estimation. In: 22nd International Conference on Artificial Intelligence and Statistics (AISTATS 2019), Okinawa, Japan, 16-18 April 2019, pp. 2661-2670.

[img]
Preview
Text
179097.pdf - Published Version
Available under License Creative Commons Attribution.

1MB

Publisher's URL: http://proceedings.mlr.press/v89/uhrenholt19a.html

Abstract

We consider the problem of estimating a target vector by querying an unknown multi-output function which is stochastic and expensive to evaluate. Through sequential experimental design the aim is to minimize the squared Euclidean distance between the output of the function and the target vector. Applying standard single-objective Bayesian optimization to this problem is both wasteful, since individual output components are never observed, and imprecise since the predictive distribution for new inputs will be symmetric and have negative support. We address this issue by proposing a Gaussian process model that considers the individual function outputs and derive a distribution over the resulting 2-norm. Furthermore we derive computationally efficient acquisition functions and evaluate the resulting optimization framework on several synthetic problems and a real-world problem. The results demonstrate a significant improvement over Bayesian optimization based on both standard and warped Gaussian processes.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Uhrenholt, Mr Anders and Jensen, Dr Bjorn
Authors: Uhrenholt, A., and Jensen, B. S.
College/School:College of Science and Engineering > School of Computing Science
ISSN:2640-3498
Copyright Holders:Copyright © 2019 The Authors
First Published:First published in Proceedings of Machine Learning Research 89:2661-2670
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record