mlsanityData to 7 Oct 2026

Online Semi-Supervised Learning in Contextual Bandits with Episodic Reward

arXiv 2009.08457 ↗First posted 17 Sep 2020cs.LG cs.AI stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Sep 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 3; 2023: 1.

5 papers.