An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints
<|reference_start|>An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints: In this study, we consider the infinitely many-armed bandit problems in a rested rotting setting, where the mean reward of an arm may decrease with each pull, while otherwise, it remains unchanged. We explore two scenarios regarding the rotting of rewards: one in which the cumulative amount of rotting is bounded by $V_T$, referred to as the slow-rotting case, and the other in which the cumulative number of rotting instances is bounded by $S_T$, referred to as the abrupt-rotting case. To address the challenge posed by rotting rewards, we introduce an algorithm that utilizes UCB with an adaptive sliding window, designed to manage the bias and variance trade-off arising due to rotting rewards. Our proposed algorithm achieves tight regret bounds for both slow and abrupt rotting scenarios. Lastly, we demonstrate the performance of our algorithm using numerical experiments.<|reference_end|>
@article{kim2024an,
    title={An Adaptive Approach for Infinitely Many-armed Bandits under Generalized
  Rotting Constraints},
    author={Jung-hun Kim, Milan Vojnovic, Se-Young Yun},
    journal={arXiv preprint arXiv:2404.14202},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.14202},
    primaryClass={cs.LG stat.ML}
}