Toward Embedding Bayesian Optimization in the Lab: Reasoning about Resource and Actions.
Lists
Only you see this
Abstract
Bayesian optimization (BO) aims to optimize costly-to-evaluate functions by running a limited number of experiments that each evaluate the function at a selected input. Typical BO formulations assume that experiments are selected one at a time, or in fixed batches, and that experiments can be executed immediately upon request. This setup fails to capture many real-world domains where the execution of an experiment requires setup and preparation time. In this paper, we define a novel BO problem formulation that models the resources and activities needed to prepare and run experiments. We then present a planning approach, based on finite-horizon tree search, for scheduling the potentially concurrent experimental activities with the aim of best optimizing the function within a limited time horizon. A key element of the approach is a novel state evaluation function for evaluating leaves of the search tree, for which we prove approximate guarantees. We evaluate the approach on a number of diverse benchmark problems and show that it produces high-quality results compared to a number of natural baselines.
BibTeX
@inproceedings{dolatnia2015toward,
author = {Nima Dolatnia and Alan Fern and Xiaoli Z. Fern},
title = {{Toward Embedding Bayesian Optimization in the Lab: Reasoning about Resource and Actions.}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2015},
url = {https://openreview.net/forum?id=jv_z9c_mcOS},
}Loading related content...