Greedy Bandits with Sampled Context
Bayesian strategies for contextual bandits have proved promising in single-state reinforcement learning tasks by modeling uncertainty using context information from the environment. In this paper, we propose Greedy Bandits with Sampled Context (GB-SC), a method for contextual multi-armed bandits to develop the prior from the context information using Thompson Sampling, and arm selection using an epsilon-greedy policy. The framework GB-SC allows for evaluation of context-reward dependency, as well as providing robustness for partially observable context vectors by leveraging the prior developed. Our experimental results show competitive performance on the Mushroom environment in terms of expected regret and expected cumulative regret, as well as insights on how each context subset affects decision-making.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingMulti-Armed Banditsreinforcement-learningReinforcement Learning (RL)Thompson SamplingSimilar Papers 제목 키워드 기반
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms
We study the structure of regret-minimizing policies in the {\em many-armed} Bayesian multi-armed bandit problem: in particular, with $k$ the number of arms and $T$ the time horizon, we consider the case where $k \geq \s…
Multi-Armed BanditsThe Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms
We investigate a Bayesian $k$-armed bandit problem in the \emph{many-armed} regime, where $k \geq \sqrt{T}$ and $T$ represents the time horizon. Initially, and aligned with recent literature on many-armed bandit problems…
Multi-Armed BanditsWorst-case Performance of Greedy Policies in Bandits with Imperfect Context Observations
Contextual bandits are canonical models for sequential decision-making under uncertainty in environments with time-varying components. In this setting, the expected reward of each bandit arm consists of the inner product…
Decision MakingDecision Making Under UncertaintyMulti-Armed BanditsSequential Decision MakingDeep Contextual Multi-armed Bandits
Contextual multi-armed bandit problems arise frequently in important industrial applications. Existing solutions model the context either linearly, which enables uncertainty driven (principled) exploration, or non-linear…
MarketingMulti-Armed BanditsThompson SamplingStochastic Low-rank Tensor Bandits for Multi-dimensional Online Decision Making
Multi-dimensional online decision making plays a crucial role in many real applications such as online recommendation and digital marketing. In these problems, a decision at each time is a combination of choices from dif…
Decision MakingMarketing