College of Management of Technology, EPFL · Department of Computer Science, TU Munich
We study the contextual multi-armed bandit problem with a finite context space (a.k.a. subpopulations), where the learner recommends a best action for each context and is evaluated by context-weighted simple regret. Our guarantees are worst-case over the reward distributions, while remaining instance-dependent with respect to the context distribution vector
p. Akin to experimental design problems where the population of interest is fixed but the sampled subpopulation can be controlled, we allow the learner to actively choose which context to sample from. For a known
p, we characterize tight regret rates: passive sampling where contexts are randomly revealed achieves regret of order
n/T∥p∥1/2, whereas active sampling with allocation
qj∝pj2/3 achieves the tight rate
n/T∥p∥2/3. The resulting improvement can be as large as
Θ(k1/4), where
k is the number of contexts. We further extend the analysis to budgeted active sampling, characterize the corresponding tight rate, and identify when a limited active budget suffices to recover the fully active rate. When
p is unknown, we propose the Explore-Explore-Then-Commit (EETC) algorithm, which optimally balances estimating the context distribution and the time to switch to active allocation, such that for large horizons, it matches the known-
p active rate up to constants. Experiments on synthetic and real-world data support our theoretical findings.