contextual: Evaluating Contextual Multi-Armed Bandit Problems in R

Abstract

Over the past decade, contextual bandit algorithms have been gaining in popularity due to their effectiveness and flexibility in solving sequential decision problems---from online advertising and finance to clinical trial design and personalized medicine. At the same time, there are, as of yet, surprisingly few options that enable researchers and practitioners to simulate and compare the wealth of new and existing bandit algorithms in a standardized way. To help close this gap between analytical research and empirical evaluation the current paper introduces the object-oriented R package "contextual": a user-friendly and, through its object-oriented structure, easily extensible framework that facilitates parallelized comparison of contextual and context-free bandit policies through both simulation and offline analysis.

arXiv comment55 pages, 12 figures

References in corpus (11)

• A Contextual-Bandit Approach to Personalized News Article Recommendation
• Analysis of Thompson Sampling for the multi-armed bandit problem
• Thompson Sampling for Contextual Bandits with Linear Payoffs
• Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms
• Doubly Robust Policy Evaluation and Learning
• Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
• Contextual Bandits with Similarity Information
• Algorithms for multi-armed bandit problems
• Learning from Logged Implicit Exploration Data
• Making Contextual Decisions with Low Technical Debt
• Thompson sampling with the online bootstrap