Risk Seeking Bayesian Optimization Under Uncertainty for Obtaining Extremum
Abstract
Real-world black-box optimization tasks often focus on obtaining the best reward, which includes an intrinsic random quantity from uncontrollable environmental factors. For this problem, we formulate a novel risk-seeking optimization problem whose aim is to obtain the best possible reward within a fixed budget under uncontrollable factors. We consider two settings: (1) environmental model setting for the case that we can observe uncontrollable environmental variables that affect the observation as the input of a target function, and (2) heteroscedastic model setting for the case that any uncontrollable variables cannot be observed. We propose a novel Bayesian optimization method called kernel explore-then-commit (kernel-ETC) and provide the regret upper bound for both settings. We demonstrate the effectiveness of kernel-ETC through several numerical experiments, including the hyperparameter tuning task and the simulation function derived from polymer synthesis real data.
Cite
Text
Iwazaki et al. "Risk Seeking Bayesian Optimization Under Uncertainty for Obtaining Extremum." Artificial Intelligence and Statistics, 2024.Markdown
[Iwazaki et al. "Risk Seeking Bayesian Optimization Under Uncertainty for Obtaining Extremum." Artificial Intelligence and Statistics, 2024.](https://mlanthology.org/aistats/2024/iwazaki2024aistats-risk/)BibTeX
@inproceedings{iwazaki2024aistats-risk,
title = {{Risk Seeking Bayesian Optimization Under Uncertainty for Obtaining Extremum}},
author = {Iwazaki, Shogo and Tanabe, Tomohiko and Irie, Mitsuru and Takeno, Shion and Inatsu, Yu},
booktitle = {Artificial Intelligence and Statistics},
year = {2024},
pages = {1252-1260},
volume = {238},
url = {https://mlanthology.org/aistats/2024/iwazaki2024aistats-risk/}
}