mlsanityData to 14 Oct 2026

Online learning with Corrupted context: Corrupted Contextual Bandits

arXiv 2006.15194 ↗First posted 26 Jun 2020cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

We consider a novel variant of the contextual bandit problem (i.e., the multi-armed bandit with side-information, or context, available to a decision-maker) where the context used at each decision may be corrupted ("useless context"). This new problem is motivated by certain on-line settings including clinical trial and ad recommendation applications. In order to address the corrupted-context setting,we propose to combine the standard contextual bandit approach with a classical multi-armed bandit mechanism. Unlike standard contextual bandit methods, we are able to learn from all iteration, even those with corrupted context, by improving the computing of the expectation for each arm. Promising empirical results are obtained on several real-life datasets.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 0; 2025: 1.

3 papers.