Offline Contextual Bandits with High Probability Fairness Guarantees

Blossom Metevier, Stephen J Giguere, Sarah Brockman, Ari Kobren, Yuriy Brun, Emma Brunskill, Philip Thomas

Abstract: We present RobinHood, an offline contextual bandit algorithm designed to satisfy a broad family of fairness constraints. Unlike previous work, our algorithm accepts multiple fairness definitions and allows users to construct their own unique fairness definitions for the problem at hand. We provide a theoretical analysis of RobinHood, which includes a proof that it will not return an unfair solution with probability greater than a user-specified threshold. We validate our algorithm on three applications: a tutoring system in which we conduct a user study and consider multiple unique fairness definitions; a loan approval setting (using the Statlog German credit data set) in which well-known fairness definitions are applied; and criminal recidivism (using data released by Propublica). In each setting our algorithm is able to produce fair policies that achieve performance competitive with other offline and online contextual bandit algorithms.

Code Link: https://github.com/sgiguere/RobinHood-NeurIPS-2019

CMT Num: 8496