Pith. sign in

REVIEW 2 cited by

Contextual Bandit with Missing Rewards

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.06368 v2 pith:ZF6BQDKS submitted 2020-07-13 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords banditmissingcontextualrewardsclusteringproblemrewardstandard
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 reward associated with each context-based decision may not always be observed("missing rewards"). This new problem is motivated by certain online settings including clinical trial and ad recommendation applications. In order to address the missing rewards setting, we propose to combine the standard contextual bandit approach with an unsupervised learning mechanism such as clustering. Unlike standard contextual bandit methods, by leveraging clustering to estimate missing reward, we are able to learn from each incoming event, even those with missing rewards. Promising empirical results are obtained on several real-life datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

    cs.LG 2026-07 conditional novelty 7.0 of 10

    An OCO algorithm with only O(√T) static regret, pluggable as a preconditioner selector, recovers the classical O(1/√T) stationarity rate on smooth stochastic nonconvex problems and the O(T^{-2/7}) rate on nonsmooth ones.

  2. Pre-Trained AI Model Assisted Online Decision-Making under Missing Covariates: A Theoretical Perspective

    cs.LG 2025-07 unverdicted novelty 6.0 of 10

    The paper introduces model elasticity to bound the regret of contextual bandits with AI-imputed missing covariates, and shows that MAR-based calibration removes the dominant linear regret term.

Pith tools