Individually Fair Learning with One-Sided Feedback
Yahav Bechavod, Aaron Roth

TL;DR
This paper introduces an online learning framework that ensures individual fairness using one-sided feedback and multiple auditors, leveraging bandit algorithms to balance accuracy and fairness.
Contribution
It extends existing fairness frameworks to incorporate multiple, possibly inconsistent auditors and reduces the problem to a contextual semi-bandit setting for efficient learning.
Findings
Achieves multi-criteria no regret guarantees for accuracy and fairness.
Mitigates human biases by panel-based fairness violation detection.
Eliminates hidden outcome biases present in prior full-information models.
Abstract
We consider an online learning problem with one-sided feedback, in which the learner is able to observe the true label only for positively predicted instances. On each round, instances arrive and receive classification outcomes according to a randomized policy deployed by the learner, whose goal is to maximize accuracy while deploying individually fair policies. We first extend the framework of Bechavod et al. (2020), which relies on the existence of a human fairness auditor for detecting fairness violations, to instead incorporate feedback from dynamically-selected panels of multiple, possibly inconsistent, auditors. We then construct an efficient reduction from our problem of online learning with one-sided feedback and a panel reporting fairness violations to the contextual combinatorial semi-bandit problem (Cesa-Bianchi & Lugosi, 2009, Gy\"{o}rgy et al., 2007). Finally, we show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Auction Theory and Applications · Mobile Crowdsensing and Crowdsourcing
