Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.15351 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913220310073344 |
|---|---|
| author | Salgia, Sudeep Vakili, Sattar Zhao, Qing |
| author_facet | Salgia, Sudeep Vakili, Sattar Zhao, Qing |
| contents | We consider Bayesian optimization using Gaussian Process models, also referred to as kernel-based bandit optimization. We study the methodology of exploring the domain using random samples drawn from a distribution. We show that this random exploration approach achieves the optimal error rates. Our analysis is based on novel concentration bounds in an infinite dimensional Hilbert space established in this work, which may be of independent interest. We further develop an algorithm based on random exploration with domain shrinking and establish its order-optimal regret guarantees under both noise-free and noisy settings. In the noise-free setting, our analysis closes the existing gap in regret performance and thereby resolves a COLT open problem. The proposed algorithm also enjoys a computational advantage over prevailing methods due to the random exploration that obviates the expensive optimization of a non-convex acquisition function for choosing the query points at each iteration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_15351 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency Salgia, Sudeep Vakili, Sattar Zhao, Qing Machine Learning We consider Bayesian optimization using Gaussian Process models, also referred to as kernel-based bandit optimization. We study the methodology of exploring the domain using random samples drawn from a distribution. We show that this random exploration approach achieves the optimal error rates. Our analysis is based on novel concentration bounds in an infinite dimensional Hilbert space established in this work, which may be of independent interest. We further develop an algorithm based on random exploration with domain shrinking and establish its order-optimal regret guarantees under both noise-free and noisy settings. In the noise-free setting, our analysis closes the existing gap in regret performance and thereby resolves a COLT open problem. The proposed algorithm also enjoys a computational advantage over prevailing methods due to the random exploration that obviates the expensive optimization of a non-convex acquisition function for choosing the query points at each iteration. |
| title | Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2310.15351 |