AI Paper Atlas

Research map / Bandits and online learning / Contextual bandits and Thompson sampling

Offline Contextual Bandits with High Probability Fairness Guarantees

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

NeurIPS 2019 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Oracle-efficient contextual bandits · 26 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add a safety test on held-out data (RobinHood) instead of enforcing the estimated fairness constraint on all data (NaiveFairBandit)NaiveFairBandit · tutoring, loan approval, recidivismfairness violation rate (delta=5%)Improved
Use RobinHood fairness-constrained offline bandit instead of fairness-unaware POEM and Offset TreePOEM and Offset Tree · similar proportions tutoring, loan, recidivismoff-policy rewardNo clear effect
Use RobinHood instead of POEM and Offset Tree when the biased option maximizes rewardPOEM and Offset Tree · skewed proportions tutoringfairness violation rateImproved
Allow returning No Solution Found when data is insufficientRobinHood · all experimentssolution rateMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy