Predictive Bandits
원문 초록
We introduce and study a new class of stochastic bandit problems, referred to as predictive bandits. In each round, the decision maker first decides whether to gather information about the rewards of particular arms (so that their rewards in this round can be predicted). These measurements are costly, and may be corrupted by noise. The decision maker then selects an arm to be actually played in the round. Predictive bandits find applications in many areas; e.g. they can be applied to channel selection problems in radio communication systems. In this paper, we provide the first theoretical results about predictive bandits, and focus on scenarios where the decision maker is allowed to measure at most one arm per round. We derive asymptotic instance-specific regret lower bounds for these problems, and develop algorithms whose regret match these fundamental limits. We illustrate the performance of our algorithms through numerical experiments. In particular, we highlight the gains that can be achieved by using reward predictions, and investigate the impact of the noise in the corresponding measurements.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SepPrune: Structured Pruning for Efficient Deep Speech Separation
Differentiable Channel Selection in Self-Attention For Person Re-Identification
SlimSeiz: Efficient Channel-Adaptive Seizure Prediction Using a Mamba-Enhanced Network
Learning Binary Color Filter Arrays with Trainable Hard Thresholding
Improving the Evaluation and Actionability of Explanation Methods for Multivariate Time Series Classification
Quantifying Spatial Domain Explanations in BCI using Earth Mover's Distance
토론
이 논문과 연결된 포럼 글이 아직 없습니다.