Online Semi-Supervised Learning in Contextual Bandits with Episodic Reward
원문 초록
We considered a novel practical problem of online learning with episodically revealed rewards, motivated by several real-world applications, where the contexts are nonstationary over different episodes and the reward feedbacks are not always available to the decision making agents. For this online semi-supervised learning setting, we introduced Background Episodic Reward LinUCB (BerlinUCB), a solution that easily incorporates clustering as a self-supervision module to provide useful side information when rewards are not observed. Our experiments on a variety of datasets, both in stationary and nonstationary environments of six different scenarios, demonstrated clear advantages of the proposed approach over the standard contextual bandit. Lastly, we introduced a relevant real-life example where this problem setting is especially useful.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
You Can Trade Your Experience in Distributed Multi-Agent Multi-Armed Bandits
Enhancing Cluster Analysis With Explainable AI and Multidimensional Cluster Prototypes
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Graph-Structured Data Analysis of Component Failure in Autonomous Cargo Ships Based on Feature Fusion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.