Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity

Page view(s)
6
Checked on Sep 14, 2022
Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity
Title:
Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity
Other Titles:
International Conference on Machine Learning
DOI:
Publication Date:
23 July 2022
Citation:
Tay, S.S., Foo, C.S., Daisuke, U., Leong, R. & Low, B.K.H.. (2022). Efficient Distributionally Robust Bayesian Optimization with Worst-case Sensitivity. Proceedings of the 39th International Conference on Machine Learning, in Proceedings of Machine Learning Research 162:21180-21204.
Abstract:
In distributionally robust Bayesian optimization (DRBO), an exact computation of the worst-case expected value requires solving an expensive convex optimization problem. We develop a fast approximation of the worst-case expected value based on the notion of worst-case sensitivity that caters to arbitrary convex distribution distances. We provide a regret bound for our novel DRBO algorithm with the fast approximation, and empirically show it is competitive with that using the exact worst-case expected value while incurring significantly less computation time. In order to guide the choice of distribution distance to be used with DRBO, we show that our approximation implicitly optimizes an objective close to an interpretable risk-sensitive value.
License type:
Publisher Copyright
Funding Info:
This research / project is supported by the A*STAR - AME IAF-PP
Grant Reference no. : A19E4a0101

This research / project is supported by the A*STAR - AME Programmatic
Grant Reference no. : A20H6b0151

A*STAR ACIS scholarship
Description:
ISSN:
2640-3498