AI Paper Atlas

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

Achieving Counterfactual Fairness for Causal Bandit

AAAI 2022 · Bandits and online learning › Contextual bandits and Thompson sampling · approach: Ranking bandits · 18 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Apply a counterfactual-fairness constraint to the policy searchF-UCB · Email Campaignunfair decisions: 0Helped
Use a counterfactual-fairness constraint rather than unconstrained UCBEmail Campaign · Email Campaign, τ=0.1unfair decisions: 3030 vs 0Helped
Use d-separation information to estimate rewardD-UCB · Email Campaigncumulative regretHelped
Use causal information in the bandit algorithmD-UCB, F-UCB, and C-UCB · Email Campaigncumulative regretHelped
Increase the fairness threshold from τ=0.1 to τ=0.5F-UCB · Email Campaigncumulative regret: 392.12 -> 313.89Helped
Increase the fairness thresholdUCB, C-UCB, and D-UCB · Email Campaignunfair decisions: 3030 -> 18; 3176 -> 27; 3473 -> 47Helped

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