The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918216710750208 |
|---|---|
| author | Chen, Qiyuan Kontar, Raed Al |
| author_facet | Chen, Qiyuan Kontar, Raed Al |
| contents | This paper introduces a framework for Bayesian Optimization (BO) with metric movement costs, addressing a critical challenge in practical applications where input alterations incur varying costs. Our approach is a convenient plug-in that seamlessly integrates with the existing literature on batched algorithms, where designs within batches are observed following the solution of a Traveling Salesman Problem. The proposed method provides a theoretical guarantee of convergence in terms of movement costs for BO. Empirically, our method effectively reduces average movement costs over time while maintaining comparable regret performance to conventional BO methods. This framework also shows promise for broader applications in various bandit settings with movement costs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_14533 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs Chen, Qiyuan Kontar, Raed Al Methodology Machine Learning This paper introduces a framework for Bayesian Optimization (BO) with metric movement costs, addressing a critical challenge in practical applications where input alterations incur varying costs. Our approach is a convenient plug-in that seamlessly integrates with the existing literature on batched algorithms, where designs within batches are observed following the solution of a Traveling Salesman Problem. The proposed method provides a theoretical guarantee of convergence in terms of movement costs for BO. Empirically, our method effectively reduces average movement costs over time while maintaining comparable regret performance to conventional BO methods. This framework also shows promise for broader applications in various bandit settings with movement costs. |
| title | The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs |
| topic | Methodology Machine Learning |
| url | https://arxiv.org/abs/2410.14533 |