Understand the Contextual Bandits problem model in this package
masterThis package implements solutions for the contextual bandits problem (associative reinforcement learning).
Core Constraints:
- Discrete Rewards: This package deals only with discrete rewards in the set
{0, 1}. It is not intended for continuous rewards. - Shared Covariates: It assumes all arms see the same covariates (features).
- Iterative Process: At each round, an agent receives covariates, chooses an arm, and receives a reward for that arm only.
Key Problem Areas Covered:
- Online Learning (
contextualbandits.online): Managing exploration/exploitation in real-time. - Off-policy Learning (
contextualbandits.offpolicy): Learning from data collected by a different policy (Counter-factual Risk Minimization). - Policy Evaluation (
contextualbandits.evaluation): Evaluating strategies based on partially-labeled data.