Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
Guojun Xiong, Jian Li

TL;DR
This paper introduces a new reinforcement learning algorithm for adversarial restless multi-armed bandits with unknown transitions and bandit feedback, achieving near-optimal regret bounds in a challenging setting.
Contribution
It proposes the first algorithm with $ ilde{O}( oot{T})$ regret for adversarial RMAB with unknown transitions and limited feedback.
Findings
Achieves $ ilde{O}(H oot{T})$ regret bound.
Introduces a biased adversarial reward estimator.
Develops a low-complexity index policy.
Abstract
Restless multi-armed bandits (RMAB) play a central role in modeling sequential decision making problems under an instantaneous activation constraint that at most B arms can be activated at any decision epoch. Each restless arm is endowed with a state that evolves independently according to a Markov decision process regardless of being activated or not. In this paper, we consider the task of learning in episodic RMAB with unknown transition functions and adversarial rewards, which can change arbitrarily across episodes. Further, we consider a challenging but natural bandit feedback setting that only adversarial rewards of activated arms are revealed to the decision maker (DM). The goal of the DM is to maximize its total adversarial rewards during the learning process while the instantaneous activation constraint must be satisfied in each decision epoch. We develop a novel reinforcement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Adaptive Dynamic Programming Control · Reinforcement Learning in Robotics
