SOTAVerified

Warm-starting Contextual Bandits: Robustly Combining Supervised and Bandit Feedback

2019-01-02Code Available0· sign in to hype

Chicheng Zhang, Alekh Agarwal, Hal Daumé III, John Langford, Sahand N. Negahban

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We investigate the feasibility of learning from a mix of both fully-labeled supervised data and contextual bandit data. We specifically consider settings in which the underlying learning signal may be different between these two data sources. Theoretically, we state and prove no-regret algorithms for learning that is robust to misaligned cost distributions between the two sources. Empirically, we evaluate some of these algorithms on a large selection of datasets, showing that our approach is both feasible and helpful in practice.

Tasks

Reproductions