Bayesian Optimization of Function Networks with Partial Evaluations

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Buathong, Poompol, Wan, Jiayue, Astudillo, Raul, Daulton, Samuel, Balandat, Maximilian, Frazier, Peter I.
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911916513820672
author Buathong, Poompol
Wan, Jiayue
Astudillo, Raul
Daulton, Samuel
Balandat, Maximilian
Frazier, Peter I.
author_facet Buathong, Poompol
Wan, Jiayue
Astudillo, Raul
Daulton, Samuel
Balandat, Maximilian
Frazier, Peter I.
contents Bayesian optimization is a powerful framework for optimizing functions that are expensive or time-consuming to evaluate. Recent work has considered Bayesian optimization of function networks (BOFN), where the objective function is given by a network of functions, each taking as input the output of previous nodes in the network as well as additional parameters. Leveraging this network structure has been shown to yield significant performance improvements. Existing BOFN algorithms for general-purpose networks evaluate the full network at each iteration. However, many real-world applications allow for evaluating nodes individually. To exploit this, we propose a novel knowledge gradient acquisition function that chooses which node and corresponding inputs to evaluate in a cost-aware manner, thereby reducing query costs by evaluating only on a part of the network at each step. We provide an efficient approach to optimizing our acquisition function and show that it outperforms existing BOFN methods and other benchmarks across several synthetic and real-world problems. Our acquisition function is the first to enable cost-aware optimization of a broad class of function networks.
format Preprint
id arxiv_https___arxiv_org_abs_2311_02146
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Bayesian Optimization of Function Networks with Partial Evaluations
Buathong, Poompol
Wan, Jiayue
Astudillo, Raul
Daulton, Samuel
Balandat, Maximilian
Frazier, Peter I.
Machine Learning
Optimization and Control
Bayesian optimization is a powerful framework for optimizing functions that are expensive or time-consuming to evaluate. Recent work has considered Bayesian optimization of function networks (BOFN), where the objective function is given by a network of functions, each taking as input the output of previous nodes in the network as well as additional parameters. Leveraging this network structure has been shown to yield significant performance improvements. Existing BOFN algorithms for general-purpose networks evaluate the full network at each iteration. However, many real-world applications allow for evaluating nodes individually. To exploit this, we propose a novel knowledge gradient acquisition function that chooses which node and corresponding inputs to evaluate in a cost-aware manner, thereby reducing query costs by evaluating only on a part of the network at each step. We provide an efficient approach to optimizing our acquisition function and show that it outperforms existing BOFN methods and other benchmarks across several synthetic and real-world problems. Our acquisition function is the first to enable cost-aware optimization of a broad class of function networks.
title Bayesian Optimization of Function Networks with Partial Evaluations
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2311.02146