Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.12428 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910373306695680 |
|---|---|
| author | R, Rahul N Katewa, Vaibhav |
| author_facet | R, Rahul N Katewa, Vaibhav |
| contents | We consider a sequential stochastic multi-armed bandit problem where the agent interacts with bandit over multiple episodes. The reward distribution of the arms remain constant throughout an episode but can change over different episodes. We propose an algorithm based on UCB to transfer the reward samples from the previous episodes and improve the cumulative regret performance over all the episodes. We provide regret analysis and empirical results for our algorithm, which show significant improvement over the standard UCB algorithm without transfer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12428 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Transfer in Sequential Multi-armed Bandits via Reward Samples R, Rahul N Katewa, Vaibhav Machine Learning We consider a sequential stochastic multi-armed bandit problem where the agent interacts with bandit over multiple episodes. The reward distribution of the arms remain constant throughout an episode but can change over different episodes. We propose an algorithm based on UCB to transfer the reward samples from the previous episodes and improve the cumulative regret performance over all the episodes. We provide regret analysis and empirical results for our algorithm, which show significant improvement over the standard UCB algorithm without transfer. |
| title | Transfer in Sequential Multi-armed Bandits via Reward Samples |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2403.12428 |