paper-with-me

Papers

Neural Exploitation and Exploration of Contextual Bandits

2023-05-05 · Yikun Ban, Yuchen Yan, Arindam Banerjee, Jingrui He

In this paper, we study utilizing neural networks for the exploitation and exploration of contextual multi-armed bandits. Contextual multi-armed bandits have been studied for decades with various applications. To solve the exploitation-exploration trade-off in bandits, there are three main techniques: epsilon-greedy, Thompson Sampling (TS), and Upper Confidence Bound (UCB). In recent literature, a series of neural bandit algorithms have been proposed to adapt to the non-linear reward function, combined with TS or UCB strategies for exploration. In this paper, instead of calculating a large-deviation based statistical bound for exploration like previous methods, we propose, ``EE-Net,'' a novel neural-based exploitation and exploration strategy. In addition to using a neural network (Exploitation network) to learn the reward function, EE-Net uses another neural network (Exploration network) to adaptively learn the potential gains compared to the currently estimated reward for exploration. We provide an instance-based $\widetilde{\mathcal{O}}(\sqrt{T})$ regret upper bound for EE-Net and show that EE-Net outperforms related linear and neural contextual bandit baselines on real-world datasets.

📄 PDF Abstract BibTeX arXiv:2305.03784

Code (1)

banyikun/ee-net-iclr-2022 공식 구현 pytorch

Tasks

Multi-Armed BanditsThompson Sampling

Methods 이 논문이 사용한 방법론

TS Spatio-temporal features extraction that measure the stabilty. The proposed method is based on a compression algorithm named Run Length Encoding. The workflow of the method is…

Similar Papers 제목 키워드 기반

EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits

2021-10-07 · ICLR 2022 4 · Yikun Ban, Yuchen Yan, Arindam Banerjee, Jingrui He

In this paper, we propose a novel neural exploration strategy in contextual bandits, EE-Net, distinct from the standard UCB-based and TS-based approaches. Contextual multi-armed bandits have been studied for decades with…

Multi-Armed BanditsThompson Sampling

Estimation Considerations in Contextual Bandits

2017-11-19 · Maria Dimakopoulou, Zhengyuan Zhou, Susan Athey, Guido Imbens

Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lea…

Causal InferenceEconometricsMulti-Armed Bandits

Graph Neural Bandits

2023-08-21 · Yunzhe Qi, Yikun Ban, Jingrui He

Contextual bandits algorithms aim to choose the optimal arm with the highest reward out of a set of candidates based on the contextual information. Various bandit algorithms have been applied to real-world applications d…

Multi-Armed Bandits

Deep Contextual Multi-armed Bandits

2018-07-25 · Mark Collier, Hector Urdiales Llorens

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 Sampling

AdaLinUCB: Opportunistic Learning for Contextual Bandits

2019-02-20 · Xueying Guo, Xiaoxiao Wang, Xin Liu

In this paper, we propose and study opportunistic contextual bandits - a special case of contextual bandits where the exploration cost varies under different environmental conditions, such as network load or return varia…

Multi-Armed Bandits